Sciweavers

9842 search results - page 1363 / 1969
» Problem complexity
Sort
View
203
Voted
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
16 years 1 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
198
Voted
IPPS
2006
IEEE
16 years 1 months ago
Battery-aware router scheduling in wireless mesh networks
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
Chi Ma, Zhenghao Zhang, Yuanyuan Yang
190
Voted
COMPGEOM
2006
ACM
16 years 1 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
164
Voted
FOCS
2005
IEEE
16 years 27 days ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
RTAS
2005
IEEE
16 years 26 days ago
Convoy Driving through Ad-Hoc Coalition Formation
— Convoy driving on public highways is a useful phenomena which increases the safety and the throughput of the highway. We present an approach through which a wireless Convoy Dri...
Majid Ali Khan, Ladislau Bölöni
« Prev « First page 1363 / 1969 Last » Next »