805 search results - page 66 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
128
Voted
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
The scaling of CMOS technology into the nanometer era enables the fabrication of highly integrated systems, which increasingly contain analog and/or RF parts. However, scaling into...
138
click to vote
AIPS
2008
15 years 6 months ago
2008
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
146
click to vote
DISOPT
2007
15 years 4 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
128
click to vote
AAAI
2007
15 years 6 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
150
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...