419 search results - page 63 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
AIPS
1994
13 years 9 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
CP
2000
Springer
14 years 24 days ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
AIPS
2003
13 years 9 months ago
2003
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...
ICASSP
2009
IEEE
13 years 6 months ago
2009
IEEE
We consider a broadcast channel with multiple antennas at the base station and single-antenna receivers, and we study transceiver design with Quality of Service (QoS) requirements...
AAAI
2004
13 years 10 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...