AAAI
2000
13 years 5 months ago
2000
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
IADIS
2003
13 years 5 months ago
2003
We present an Information Customization framework, which offers a unique hybrid of Adaptive Hypermedia and Constraint Satisfaction methods. IC is being modelled as a constraint sa...
FLAIRS
2004
13 years 5 months ago
2004
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
AAAI
2006
13 years 5 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
EMNLP
2007
13 years 5 months ago
2007
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighte...
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
AIMSA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
AIMSA
2008
Springer
13 years 6 months ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
FLAIRS
2008
13 years 6 months ago
2008
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...