Sciweavers

5169 search results - page 218 / 1034
» Locality approximation using time
Sort
View
ICCS
2007
Springer
16 years 15 days ago
Hierarchical-Matrix Preconditioners for Parabolic Optimal Control Problems
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
Suely Oliveira, Fang Yang
ICRA
2000
IEEE
99views Robotics» more  ICRA 2000»
15 years 10 months ago
Sensor Resetting Localization for Poorly Modelled Mobile Robots
We present a new localization algorithm called Sensor Resetting Localization which is an extension of Monte Carlo Localization. The algorithm adds sensor based resampling to Monte...
Scott Lenser, Manuela M. Veloso
COMGEO
2011
ACM
14 years 10 months ago
What to do with 500M location requests a day?
Skyhook Wireless provides hybrid positioning to millions of mobile devices around the world. Using an approach that integrates cell, WiFi, and GPS signals, the system services ove...
Kipp Jones, Richard Sutton
AIPS
2006
15 years 7 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith
148
Voted
ICRA
2003
IEEE
96views Robotics» more  ICRA 2003»
15 years 11 months ago
Marco polo localization
We introduce the Marco Polo Localization approach, where we apply sound as a tool for gathering range measurements between robots, and use those to solve a range-only Simultaneous...
Eric Beowulf Martinson, Frank Dellaert