Sciweavers

2109 search results - page 9 / 422
» Solving Necklace Constraint Problems
Sort
View
EVOW
2008
Springer
13 years 11 months ago
A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
Bart G. W. Craenen, Ben Paechter
ATAL
2004
Springer
14 years 3 months ago
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
Distributed Constraint Optimization Problems (DCOP) have, for a long time, been considered an important research area for multi-agent systems because a vast number of realworld si...
Roger Mailler, Victor R. Lesser
BPSC
2009
240views Business» more  BPSC 2009»
13 years 11 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
2008
14 years 4 days ago
Hybrid Constraint Tightening for Solving Hybrid Scheduling Problems
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
James C. Boerkoel Jr., Edmund H. Durfee
AI
2008
Springer
13 years 10 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...