Sciweavers

1480 search results - page 2 / 296
» Ants can solve constraint satisfaction problems
Sort
View
AAAI
1996
13 years 6 months ago
Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
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...
Peggy S. Eaton, Eugene C. Freuder
CP
1995
Springer
13 years 8 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
SAT
2010
Springer
174views Hardware» more  SAT 2010»
13 years 3 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret
BPSC
2009
240views Business» more  BPSC 2009»
13 years 6 months ago
Modelling and Solving Configuration Problems on Business Processes Using a Multi-Level Constraint Satisfaction Approach
Abstract: In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle t levels of...
Wolfgang Runte
AAAI
1994
13 years 6 months ago
GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
Andrew J. Davenport, Edward P. K. Tsang, Chang J. ...