10608 search results - page 556 / 2122 » Complexity of O'Hara's Algorithm |
185
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Cooperative approaches have proved to be very useful in evolutionary computation due to their ability to solve efficiently high-dimensional complex problems through the cooperatio...
199
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
176
click to vote
CRYPTO
2004
Springer
16 years 14 days ago
2004
Springer
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
199
click to vote
COSIT
2003
Springer
16 years 9 days ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
170
click to vote
COMPGEOM
2010
ACM
16 years 5 days ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...