Sciweavers

1871 search results - page 310 / 375
» The Ephemeral Pairing Problem
Sort
View
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
16 years 21 days 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
COMSWARE
2006
IEEE
16 years 14 days ago
Resource management in heterogenous wireless networks with overlapping coverage
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
Bin Bin Chen, Mun Choon Chan
FOCS
2006
IEEE
16 years 14 days ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
16 years 13 days 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
SPAA
2005
ACM
15 years 12 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski