1024 search results - page 110 / 205 » Value complete, column complete, predicate complete |
113
click to vote
ICCAD
1994
IEEE
15 years 5 months ago
1994
IEEE
We present a new min-cut based placement algorithm for large scale sea-of-gates arrays. In the past all such algorithms used a xed cut line sequence that is determined before min...
101
Voted
DLOG
2008
15 years 4 months ago
2008
A fundamental requirement for cooperating agents is to agree on a selection of component values of objects that can be used for reliably communicating references to the objects, to...
131
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
127
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
107
click to vote
IJCAI
2003
15 years 3 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...