494 search results - page 46 / 99 » Optimal Carpet Cutting |
ASPDAC
2001
ACM
15 years 3 months ago
2001
ACM
We propose a timing optimization technique for a complex finite state machine that consists of not only random logic but also data operators. In such a design, the timing critical...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...
130
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
109
click to vote
UAI
2004
15 years 1 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
STOC
1995
ACM
15 years 3 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...