Sciweavers

16082 search results - page 169 / 3217
» Fireworks Algorithm for Optimization
Sort
View
CORR
2010
Springer
148views Education» more  CORR 2010»
15 years 6 months ago
Perturbation Resilience and Superiorization of Iterative Algorithms
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
Yair Censor, R. Davidi, Gabor T. Herman
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
15 years 7 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
JNW
2008
124views more  JNW 2008»
15 years 6 months ago
A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...
Shahab Kamali, Jaroslav Opatrny
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 10 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
15 years 10 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar