Sciweavers

5153 search results - page 355 / 1031
» Introduction to Randomized Algorithms
Sort
View
GLOBECOM
2008
IEEE
15 years 11 months ago
Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
Kostas Christodoulopoulos, Konstantinos Manousakis...
SASO
2008
IEEE
15 years 11 months ago
Empirical Characterization of Discretization Error in Gradient-Based Algorithms
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
Jonathan Bachrach, Jacob Beal, Joshua Horowitz, Da...
CEC
2007
IEEE
15 years 11 months ago
Implicit alternative splicing for genetic algorithms
— In this paper we present a new nature-inspired variation operator for binary encodings in genetic algorithms (GAs). Our method, called implicit alternative splicing (iAS), is r...
Philipp Rohlfshagen, John A. Bullinaria
147
Voted
PEWASUN
2005
ACM
15 years 10 months ago
Impact of mobility prediction on the temporal stability of MANET clustering algorithms
Scalability issues for routing in mobile ad hoc networks (MANETs) have been typically addressed using hybrid routing schemes operating in a hierarchical network architecture. Seve...
Aravindhan Venkateswaran, Venkatesh Sarangan, Nata...
AE
2005
Springer
15 years 10 months ago
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
Anne Auger, Mohamed Jebalia, Olivier Teytaud