1197 search results - page 31 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper, we consider two types of inverse sorting problems. The first type is an inverse sorting problem under weighted Hamming distance with bound constraints, wh...
CPAIOR
2007
Springer
14 years 3 months ago
2007
Springer
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
GLOBECOM
2008
IEEE
13 years 9 months ago
2008
IEEE
Traditional hop-by-hop dynamic routing makes inefficient use of network resources as it forwards packets along already congested shortest paths while uncongested longer paths may b...
PERCOM
2006
ACM
14 years 8 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
IJCAI
2003
13 years 10 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...