973 search results - page 89 / 195 » New Bounds on Crossing Numbers |
DATE
2010
IEEE
15 years 5 months ago
2010
IEEE
—The admission control problem is concerned with determining whether a new task may be accepted by a system consisting of a set of running tasks, such that the already admitted a...
CP
2007
Springer
15 years 3 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
140
click to vote
SPIRE
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
106
click to vote
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
FCT
1999
Springer
15 years 4 months ago
1999
Springer
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...