Sciweavers

226 search results - page 16 / 46
» Lower bounds on the obstacle number of graphs
Sort
View
COCOON
2005
Springer
14 years 1 months ago
Exploring Simple Grid Polygons
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
JGT
2008
97views more  JGT 2008»
13 years 7 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena
TIT
2010
107views Education» more  TIT 2010»
13 years 2 months ago
Information inequalities for joint distributions, with interpretations and applications
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Mokshay M. Madiman, Prasad Tetali
SIROCCO
2007
13 years 9 months ago
Location Oblivious Distributed Unit Disk Graph Coloring
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
Mathieu Couture, Michel Barbeau, Prosenjit Bose, P...
AUTOMATICA
2004
147views more  AUTOMATICA 2004»
13 years 7 months ago
Interval analysis and dioid: application to robust controller design for timed event graphs
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
Mehdi Lhommeau, Laurent Hardouin, Bertrand Cottenc...