Sciweavers

1884 search results - page 135 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
15 years 6 months ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt
ANTSW
2006
Springer
15 years 6 months ago
Extending the Particle Swarm Algorithm to Model Animal Foraging Behaviour
The particle swarm algorithm contains elements which map fairly strongly to the foraging problem in behavioural ecology. In this paper, we show how some simple adaptions to the sta...
Cecilia Di Chio, Riccardo Poli, Paolo Di Chio
112
Voted
TON
2010
198views more  TON 2010»
14 years 9 months ago
On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...
V. J. Venkataramanan, Xiaojun Lin
124
Voted
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
16 years 2 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
105
Voted
STACS
2004
Springer
15 years 7 months ago
Algorithms for SAT Based on Search in Hamming Balls
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolper...