Sciweavers

4403 search results - page 367 / 881
» Galois Theory of Algorithms
Sort
View
PODC
2005
ACM
16 years 11 days 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
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
16 years 10 days ago
On the complexity of hierarchical problem solving
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
GECCO
2005
Springer
122views Optimization» more  GECCO 2005»
16 years 10 days ago
An enhanced GA to improve the search process reliability in tuning of control systems
Evolutionary Algorithms (EAs) have been largely applied to optimisation and synthesis of controllers. In spite of several successful applications and competitive solutions, the st...
Andrea Soltoggio
COMPGEOM
2004
ACM
16 years 7 days ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
181
Voted
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
16 years 5 days ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar