Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Information Content of Online Problems. Advice versus Determinism and Randomization

Information Content of Online Problems. Advice versus Determinism and Randomization

Smula, Jasmin

Paperback

General Computers

ISBN10: 3736990731
ISBN13: 9783736990739
Publisher: Cuvillier
Published: Aug 11 2015
Pages: 174
Weight: 0.47
Height: 0.37 Width: 5.83 Depth: 8.27
Language: English
In online computation, an algorithm has to solve some optimization problem while receiving the input instance gradually, without any knowledge about the future input. Such an online algorithm has to compute parts of the output for parts of the input, based on what it knows about the input so far and without being able to revoke its decisions later. Almost inevitably, the algorithm makes a bad choice at some point that leads to a solution that is suboptimal with respect to the whole input instance. Compared to an offline algorithm that is given the entire input instance at once, the online algorithm thus has a substantial handicap. Developing online algorithms that nonetheless compute solutions of some adequate quality is a large and rich field of research within computer science.

Also in

General Computers

View All