Sciweavers

14548 search results - page 236 / 2910
» The Optimal Path-Matching Problem
Sort
View
COCOON
2005
Springer
15 years 8 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
CEC
2009
IEEE
15 years 6 months ago
A dynamic artificial immune algorithm applied to challenging benchmarking problems
Abstract-- In many real-world scenarios, in contrast to standard benchmark optimization problems, we may face some uncertainties regarding the objective function. One source of the...
Fabrício Olivetti de França, Fernand...
121
Voted
AAAI
2007
15 years 4 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
CONSTRAINTS
2006
120views more  CONSTRAINTS 2006»
15 years 2 months ago
Constraint Models for the Covering Test Problem
Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop c...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
88
Voted
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 8 months ago
Eye-tracking evolutionary algorithm to minimize user fatigue in IEC applied to interactive one-max problem
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...
Denis Pallez, Philippe Collard, Thierry Baccino, L...