543 search results - page 96 / 109 » New Upper Bounds for MaxSat |
ICRA
2007
IEEE
15 years 3 months ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
TCC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
129
click to vote
LICS
1991
IEEE
15 years 1 months ago
1991
IEEE
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...