1197 search results - page 4 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CPAIOR
2010
Springer
14 years 23 days ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
IEAAIE
2001
Springer
14 years 12 days ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
ICC
2011
IEEE
12 years 7 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
LSSC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
ECAI
2000
Springer
14 years 8 days ago
2000
Springer
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...