Sciweavers

206 search results - page 30 / 42
» Ant colony optimization and the minimum cut problem
Sort
View
TEC
2008
98views more  TEC 2008»
14 years 9 months ago
Opposition-Based Differential Evolution
Evolutionary Algorithms (EAs) are well-known optimization approaches to cope with non-linear, complex problems. These population-based algorithms, however, suffer from a general we...
Shahryar Rahnamayan, Hamid R. Tizhoosh, Magdy M. A...
WG
2004
Springer
15 years 2 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
CORR
2002
Springer
79views Education» more  CORR 2002»
14 years 9 months ago
Optimally cutting a surface into a disk
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
Jeff Erickson, Sariel Har-Peled
GLOBECOM
2010
IEEE
14 years 7 months ago
Graph-Based Optimization for Relay-Assisted Bidirectional Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
Yuan Liu, Meixia Tao
86
Voted
HM
2005
Springer
97views Optimization» more  HM 2005»
15 years 3 months ago
Comparing Parallelization of an ACO: Message Passing vs. Shared Memory
We present a shared memory approach to the parallelization of the Ant Colony Optimization (ACO) metaheuristic and a performance comparison with an existing message passing implemen...
Pierre Delisle, Marc Gravel, Michaël Krajecki...