Sciweavers

13214 search results - page 2288 / 2643
» Pseudorandomness for network algorithms
Sort
View
232
Voted
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
16 years 1 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 1 months ago
Evolving virtual creatures revisited
Thirteen years have passed since Karl Sims published his work on evolving virtual creatures. Since then, several novel approaches to neural network evolution and genetic algorithm...
Peter Krcah
HIPC
2007
Springer
16 years 1 months ago
Distributed Ranked Search
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhat...
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
16 years 29 days ago
Dynamic Highway-Node Routing
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
Dominik Schultes, Peter Sanders
BROADNETS
2006
IEEE
16 years 27 days ago
A Statistical Approach to Anomaly Detection in Interdomain Routing
Abstract— A number of events such as hurricanes, earthquakes, power outages can cause large-scale failures in the Internet. These in turn cause anomalies in the interdomain routi...
Shivani Deshpande, Marina Thottan, Tin Kam Ho, Bip...
« Prev « First page 2288 / 2643 Last » Next »