3082 search results - page 84 / 617 » New Bounds for the Controller Problem |
156
click to vote
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
131
Voted
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
125
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
152
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
153
click to vote
DAMON
2009
Springer
15 years 10 months ago
2009
Springer
Database engines face growing scalability challenges as core counts exponentially increase each processor generation, and the efficiency of synchronization primitives used to prot...