Sciweavers

717 search results - page 43 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
109 views 98 votes 15 years 5 months ago  ECAI 2000»
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...
104 views 121 votes 15 years 3 months ago  CP 2008»
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
147 views 111 votes 15 years 5 months ago  AUSAI 2006»
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
245 views 145 votes 15 years 7 months ago  ECAI 2004»
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
131 views 88 votes 15 years 2 months ago  FLAIRS 2003»
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
114 views 112 votes 15 years 7 months ago  CP 2005»
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...
136 views 126 votes 15 years 2 months ago  FLAIRS 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...
105 views 115 votes 15 years 1 months ago  CONSTRAINTS 2006»
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
102 views 89 votes 15 years 6 months ago  ICCBR 2003»
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
174 views 107 votes 15 years 1 months ago  ENDM 2000»
Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. W...