Sciweavers

400 search results - page 57 / 80
» Lower Bounds Using Kolmogorov Complexity
Sort
View
TCS
2008
13 years 8 months ago
Bincoloring
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...
ICT
2004
Springer
130views Communications» more  ICT 2004»
14 years 2 months ago
Rayleigh Fading Multiple Access Channel Without Channel State Information
— In this paper we determine bounds of the capacity region of a two-user multipleaccess channel with Rayleigh fading when neither the transmitters nor the receiver has channel st...
Ninoslav Marina
FOCM
2010
108views more  FOCM 2010»
13 years 7 months ago
Parallelization Method for a Continuous Property
Abstract. An automated method of general purpose is introduced for computing a rigorous estimate of a bounded region in Rn whose points satisfy a given property. The method is base...
Pawel Pilarczyk
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
14 years 3 months ago
MRBUG: A Competitive Multi-Robot Path Finding Algorithm
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
14 years 2 months ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely