Sciweavers

4372 search results - page 256 / 875
» Algorithmic Theories of Everything
Sort
View
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 6 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 3 days ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
15 years 11 months ago
Toward evolved flight
We present the first hardware-in-the-loop evolutionary optimization on an ornithopter. Our experiments demonstrate the feasibility of evolving flight through genetic algorithms an...
Rusty Hunt, Gregory Hornby, Jason D. Lohn
COMPGEOM
2004
ACM
15 years 11 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
15 years 11 months ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...