2925 search results - page 36 / 585 » Information Complexity of Online Problems |
141
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
146
click to vote
CN
2006
15 years 6 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
161
click to vote
ACTA
1998
15 years 5 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
154
click to vote
WAOA
2004
Springer
15 years 11 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
144
click to vote
NIPS
2003
15 years 7 months ago
2003
Online mechanism design (MD) considers the problem of providing incentives to implement desired system-wide outcomes in systems with self-interested agents that arrive and depart ...