3471 search results - page 11 / 695 » Obstacle Numbers of Graphs |
ICRA
2002
IEEE
14 years 24 days ago
2002
IEEE
This paper presents a characterization study of the Sick LMS 200 laser scanner. A number of parameters, such as operation time, data transfer rate, target surface properties, as w...
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. For a fixed integer k 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k "walls",...
GD
2006
Springer
13 years 11 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
JIRS
2007
13 years 7 months ago
2007
The problem of developing local reactive obstacle-avoidance behaviors by a mobile robot through online real-time learning is considered. The robot operated in an unknown bounded 2...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...