539 search results - page 57 / 108 » An Improved Upper Bound for SAT |
159
click to vote
ICALP
2004
Springer
15 years 11 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 ...
160
click to vote
COMPGEOM
2006
ACM
15 years 9 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...
146
click to vote
CORR
2008
Springer
15 years 6 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...
158
click to vote
NAACL
2010
15 years 4 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...
182
click to vote
STOC
2006
ACM
16 years 6 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...