4524 search results - page 239 / 905 » The Complexity of Global Constraints |
194
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
196
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes a polynomial time algorithm for min-area retiming for edge-triggered circuits to handle both setup and hold constraints. Given a circuit G and a target clock ...
189
click to vote
AGP
1998
IEEE
15 years 11 months ago
1998
IEEE
Visualization of program executions has been found useful in applications which include education and debugging. However, traditional visualization techniques often fall short of ...
156
click to vote
CDB
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
208
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...