Sciweavers

4565 search results - page 598 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
ICALP
2009
Springer
16 years 3 months ago
Improved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
Monaldo Mastrolilli, Ola Svensson
99
Voted
ICS
2010
Tsinghua U.
16 years 23 days ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
90
Voted
SECON
2007
IEEE
15 years 9 months ago
Analysis of Search Schemes in Cognitive Radio
— Cognitive Radio systems face an important challenge – fast and reliable channel searching to enable secondary users to optimize available spectral resources. We revisit conve...
Ling Luo, S. Roy
166
Voted
EUROGP
2007
Springer
175views Optimization» more  EUROGP 2007»
15 years 9 months ago
Fast Genetic Programming on GPUs
As is typical in evolutionary algorithms, fitness evaluation in GP takes the majority of the computational effort. In this paper we demonstrate the use of the Graphics Processing...
Simon Harding, Wolfgang Banzhaf
111
Voted
GECCO
2007
Springer
140views Optimization» more  GECCO 2007»
15 years 9 months ago
On the moments of the sampling distribution of particle swarm optimisers
A method is presented that allows one to exactly determine all the characteristics of a PSO’s sampling distribution and explain how it changes over time, in the presence stochas...
Riccardo Poli