The goal of an Evolutionary Algorithm(EA) is to find the optimal solution to a given problem by evolving a set of initial potential solutions. When the problem is multi-modal, an ...
Konstantinos Bousmalis, Gillian M. Hayes, Jeffrey ...
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...