453 search results - page 31 / 91 » Tight bounds for the partial-sums problem |
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...
176
click to vote
AAAI
2008
15 years 8 months ago
2008
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
184
Voted
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
195
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
177
click to vote
WAOA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...