3082 search results - page 12 / 617 » New Bounds for the Controller Problem |
127
click to vote
SLS
2009
Springer
15 years 10 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
141
Voted
IJCAI
2007
15 years 4 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
103
click to vote
MFCS
1989
Springer
15 years 7 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
161
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the b...
148
click to vote
ADHOC
2004
15 years 3 months ago
2004
The IEEE 802.11 standard for medium access control in wireless local area networks has been adopted as the de-facto medium access control standard in multi-hop wireless networks. I...