Sciweavers

986 search results - page 88 / 198
» Algorithmic Lower Bounds for Problems Parameterized by Cliqu...
Sort
View
139
Voted
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
15 years 9 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
120
Voted
GI
2009
Springer
15 years 1 months ago
Gaussian Mixture (GM) Passive Localization using Time Difference of Arrival (TDOA)
: This paper describes the passive emitter localization using Time Difference of Arrival (TDOA) measurements. It investigates various methods for estimating the solution of this no...
Regina Kaune
128
Voted
ATMOS
2008
118views Optimization» more  ATMOS 2008»
15 years 5 months ago
Recoverable Robustness for Railway Rolling Stock Planning
Abstract. In this paper we explore the possibility of applying the notions of Recoverable Robustness and Price of Recoverability (introduced by [5]) to railway rolling stock planni...
Valentina Cacchiani, Alberto Caprara, Laura Galli,...
136
Voted
ICALP
2009
Springer
15 years 10 months ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
118
Voted
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 8 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak