Sciweavers

717 search results - page 37 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
211 views 108 votes 15 years 2 months ago  ECAI 2010»
Abstract. This paper introduces restart and nogood recording techniques in the domain of qualitative spatial and temporal reasoning. Nogoods and restarts can be applied orthogonall...
122 views 120 votes 15 years 5 months ago  CP 1997»
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
148 views 134 votes 14 years 11 months ago  LICS 2010»
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
143 views 103 votes 15 years 2 months ago  IJCAI 2003»
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
101 views 101 votes 15 years 2 months ago  AAAI 1996»
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
127 views 111 votes 15 years 5 months ago  ERCIMDL 2000»
This paper presents a research proposal on user -oriented evaluation method to compar e the usability of Internet search tools. Cognitive style and problem solving style are identi...
115 views 95 votes 15 years 6 months ago  IAT 2003»
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
136 views 130 votes 14 years 11 months ago  CORR 2010»
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
126 views 144 votes 15 years 2 months ago  AAAI 1994»
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
107 views 112 votes 15 years 7 months ago  SMA 2006»
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...