1197 search results - page 30 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CP
1997
Springer
14 years 1 months ago
1997
Springer
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 ...
WLP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling probl...
ISLPED
1998
ACM
14 years 1 months ago
1998
ACM
This paper presents a model of dynamically variable voltage processor and basic theorems for power-delay optimization. A static voltage scheduling problem is also proposed and for...
CP
2006
Springer
14 years 28 days ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...