805 search results - page 63 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
120
click to vote
AIPS
2000
15 years 5 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
155
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
Transmit-power control is a critical task in cognitive radio (CR) networks. In the present contribution, adherence to hierarchies between primary and secondary users in a peer-to-...
144
click to vote
CONEXT
2010
ACM
15 years 2 months ago
2010
ACM
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
143
click to vote
EUROGP
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
134
click to vote
COMPULOG
1999
Springer
15 years 8 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...