1197 search results - page 91 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Searching objects within a catalog is a problem of increasing importance, as the general public has access to increasing volumes of data. Constraint programming has addre...
CP
2005
Springer
14 years 1 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
IFM
2009
Springer
14 years 2 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
JDCTA
2010
13 years 3 months ago
2010
To solve the cruise two-dimensional revenue management problem and develop such an automated system under uncertain environment, a static model which is a stochastic integer progr...
CP
2009
Springer
14 years 9 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...