539 search results - page 57 / 108 » An Improved Upper Bound for SAT |
ICALP
2004
Springer
14 years 1 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 ...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
NAACL
2010
13 years 5 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...