Sciweavers

1802 search results - page 248 / 361
» Complexity Theory for Operators in Analysis
Sort
View
PODC
2005
ACM
15 years 12 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
SPAA
2005
ACM
15 years 12 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
GECCO
2005
Springer
197views Optimization» more  GECCO 2005»
15 years 12 months ago
Performance assessment of an artificial immune system multiobjective optimizer by two improved metrics
In this study, we introduce two improved assessment metrics of multiobjective optimizers, Nondominated Ratio and Spacing Distribution, and analyze their rationality and validity. ...
Maoguo Gong, Licheng Jiao, Haifeng Du, Ronghua Sha...
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 12 months ago
Real-coded crossover as a role of kernel density estimation
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
Jun Sakuma, Shigenobu Kobayashi
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 12 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint