3049 search results - page 431 / 610 » On the Convergence of Bound Optimization Algorithms |
113
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
145
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
164
click to vote
TC
2002
15 years 4 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
127
click to vote
GD
2005
Springer
15 years 10 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
143
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...