10575 search results - page 1930 / 2115 » Programming Languages |
67
Voted
APLAS
2005
ACM
15 years 3 months ago
2005
ACM
Dependences for Alarm Diagnosis Xavier Rival ´Ecole Normale Sup´erieure 45, rue d’Ulm, 75230, Paris cedex 5, France We propose a framework for dependence analyses, adapted –a...
82
Voted
CP
2005
Springer
15 years 3 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
85
Voted
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
91
Voted
CP
2005
Springer
15 years 3 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
77
Voted
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...