805 search results - page 93 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
113
click to vote
ASPDAC
2006
ACM
15 years 10 months ago
2006
ACM
System-on-chip and system-in-package result in increased number of I/O cells and complicated constraints for both chip designs and package designs. This renders the traditional ma...
128
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
156
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
176
click to vote
ISPD
1997
ACM
15 years 8 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
120
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We propose here a new approach for video sequence interpretation based on declarative models of activities. The aim of the video sequence interpretation is to recognize i...