2095 search results - page 194 / 419 » Improved pebbling bounds |
214
click to vote
MFCS
2005
Springer
16 years 1 days ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
142
click to vote
SOFSEM
2005
Springer
16 years 1 days ago
2005
Springer
We give a new characterization of those languages that are definable in fragments of LTL where the nesting depths of X and U modalities are bounded by given constants. This brings...
148
click to vote
WOSP
2004
ACM
15 years 12 months ago
2004
ACM
Designs for distributed systems must consider the possibility that failures will arise and must adopt specific failure detection strategies. We describe and analyze a self-regulat...
173
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding agents. The quality of a coordination ...
137
click to vote
SAC
2010
ACM
15 years 12 months ago
2010
ACM
The canonical algorithm to enforce box consistency over a constraint relies on a dichotomic process to isolate the leftmost and rightmost solutions. We identify some weaknesses of...