Sciweavers

646 search results - page 69 / 130
» Generalized connected domination in graphs
Sort
View
SOFSEM
1997
Springer
14 years 27 days ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
DAC
1994
ACM
14 years 8 days ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
EJC
2008
13 years 8 months ago
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
Jan Foniok, Jaroslav Nesetril, Claude Tardif
ICRA
2002
IEEE
98views Robotics» more  ICRA 2002»
14 years 1 months ago
Sensor-Based Exploration for Convex Bodies: A New Roadmap for a Convex-Shaped Robot
We present a new algorithm that enables a convex shaped robot to explore an unknown planar workspace, i.e., an unknown configuration space diffeomorphic to SE(2). This new algor...
Ji Yeong Lee, Howie Choset
IPSN
2010
Springer
14 years 3 months ago
Multichannel reliability assessment in real world WSNs
We study the utility of dynamic frequency agility in realworld wireless sensor networks. Many view such agility as essential to obtaining adequate reliability in industrial enviro...
Jorge Ortiz, David E. Culler