Sciweavers

3204 search results - page 298 / 641
» The Alcuin Number of a Graph
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Lightweight Coloring and Desynchronization for Networks
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leon...
IAT
2008
IEEE
16 years 1 months ago
Quantum Service Selection
Quantum service selection facilitates matchmaking of Web services and greatly benefits from quantum memory exponential in the number of its qubits as well as from computational s...
Matthias Klusch, René Schubotz
ICRA
2007
IEEE
146views Robotics» more  ICRA 2007»
16 years 1 months ago
Crowds of Moving Objects: Navigation Planning and Simulation
Abstract— This paper presents a solution to interactive navigation planning and real-time simulation of a very large number of entities moving in a virtual environment. From the ...
Julien Pettré, Helena Grillon, Daniel Thalm...
ICRA
2006
IEEE
86views Robotics» more  ICRA 2006»
16 years 22 days ago
The Statistical Dynamics of Programmed Self-assembly
Abstract— We describe how a graph grammar program for robotic self-assembly, together with measurements of kinetic rate data yield a Markov Process model of the dynamics of progr...
Nils Napp, Samuel Burden, Eric Klavins
IPPS
2005
IEEE
16 years 9 days ago
Self-Stabilizing Anonymous Leader Election in a Tree
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
Zhenyu Xu, Pradip K. Srimani