537 search results - page 95 / 108 » A new upper bound for 3-SAT |
WDAG
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
ICRA
2007
IEEE
14 years 2 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
14 years 2 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
14 years 2 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
14 years 1 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...