Sciweavers

835 search results - page 10 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
HEURISTICS
2002
108views more  HEURISTICS 2002»
13 years 6 months ago
Cooperative Parallel Tabu Search for Capacitated Network Design
We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and co...
Teodor Gabriel Crainic, Michel Gendreau
WABI
2004
Springer
14 years 1 days ago
Finding Optimal Pairs of Patterns
We consider the problem of finding the optimal pair of string patterns for discriminating between two sets of strings, i.e. finding the pair of patterns that is best with respect...
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, ...
GECCO
2004
Springer
111views Optimization» more  GECCO 2004»
14 years 3 days ago
Cooperative Problem Solving Using an Agent-Based Market
A key problem in multi-agent systems research is identifying appropriate techniques to facilitate effective cooperation between agents. In this paper, we investigate the efficacy o...
David Cornforth, Michael Kirley
AEI
2004
150views more  AEI 2004»
13 years 6 months ago
Ant colony optimization techniques for the vehicle routing problem
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
John E. Bell, Patrick R. McMullen
SIAMSC
2008
193views more  SIAMSC 2008»
13 years 6 months ago
Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
Sadegh Jokar, Marc E. Pfetsch