Sciweavers

209 search results - page 27 / 42
» The Computational Complexity of Weak Saddles
Sort
View
PODC
2009
ACM
14 years 8 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
RECOMB
2008
Springer
14 years 7 months ago
Perfect DCJ Rearrangement
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
Sèverine Bérard, Annie Chateau, Cedr...
AGENTS
2001
Springer
14 years 14 hour ago
It knows what you're going to do: adding anticipation to a Quakebot
The complexity of AI characters in computer games is continually improving; however they still fall short of human players. In this paper we describe an AI bot for the game Quake ...
John E. Laird
SAC
2000
ACM
13 years 12 months ago
The Evolution of the DARWIN System
DARWIN is a web-based system for presenting the results of wind-tunnel testing and computational model analyses to aerospace designers. DARWIN captures the data, maintains the inf...
Joan D. Walton, Robert E. Filman, David J. Korsmey...
EUROPAR
2010
Springer
13 years 8 months ago
Ants in Parking Lots
Ants provide an attractive metaphor for robots that "cooperate" in performing complex tasks. What, however, are the algorithmic consequences of following this metaphor? ...
Arnold L. Rosenberg