Sciweavers

1480 search results - page 140 / 296
» Ants can solve constraint satisfaction problems
Sort
View
ATAL
2007
Springer
16 years 20 days ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
JSS
2010
136views more  JSS 2010»
15 years 1 months ago
Automated diagnosis of feature model configurations
Software product-lines (SPLs) are software architectures that can be readily reconfigured for different project requirements. A key part of an SPL is a model that captures the rul...
Jules White, David Benavides, Douglas C. Schmidt, ...
IJCAI
2003
15 years 7 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
PATAT
2004
Springer
151views Education» more  PATAT 2004»
15 years 12 months ago
Decomposition and Parallelization of Multi-resource Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
Petr Slechta
IWSAS
2000
Springer
15 years 10 months ago
Imposing Real-Time Constraints on Self-Adaptive Controller Synthesis
Abstract. Self-adaptive systems must recon gure themselves, at runtime, to compensate for changing environments, objectives, and system capabilities. This paper discusses how the S...
David J. Musliner