Results 331 to 340 of about 151,821 (357)
Some of the next articles are maybe not open access.
Constraint Programming and Graph Algorithms
2000In the spring of’ 99 my colleague Gert Smolka gave me a short introduction to constraint programming. During our discussion Gert emphasized that the search for efficient propagation algorithms leads to hard and well motivated questions in algorithmics. He pointed me to the papers [Reg94] by J.-C.
openaire +2 more sources
Hybrid Algorithms in Constraint Programming
2007This paper surveys hybrid algorithms from a constraint programming perspective. It introduces techniques used within a constructive search framework, such as propagation and linear relaxation, as well as techniques used in combination with search by repair.
openaire +1 more source
Constraint satisfaction problems
ACM SIGLOG News, 2018In this paper we briefly survey the history of the Dichotomy Conjecture for the Constraint Satisfaction problem, that was posed 25 years ago by Feder and Vardi. We outline some of the approaches to this conjecture, and then describe an algorithm that yields an answer to the conjecture.
openaire +1 more source
Incremental algorithms for managing temporal constraints
Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence, 2005This paper addresses the problem of efficiently updating a network of temporal constraints when constraints are removed from or added to an existing network. Such processing tasks are important in many AI applications requiring a temporal reasoning module.
GEREVINI, Alfonso Emilio +2 more
openaire +2 more sources
Algorithm 744: a stochastic algorithm for global optimization with constraints
ACM Transactions on Mathematical Software, 1995A stochastic algorithm is presented for finding the global optimum of a function of n variables subject to general constraints. The algorithm is intended for moderate values of n , but it can accommodate objective and constraint functions that are discontinuous and can take advantage of ...
openaire +2 more sources
A Filtering Algorithm for the Stretch Constraint
2001This paper describes a filtering algorithm for a type of constraint that often arises in rostering problems but that also has wider application. Defined on a sequence of variables, the stretch constraint restricts the number of consecutive identical values in the sequence.
openaire +1 more source
Constraint satisfaction — Algorithms and complexity analysis
Information Processing Letters, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
An algorithm for evolving protocol constraints.
2006We present an investigation into the design of an evolutionary mechanism for multiagent protocol constraint optimisation. Starting with a review of common population based mechanisms we discuss the properties of the mechanisms used by these search methods.
openaire +1 more source