Sciweavers

545 search results - page 41 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
15 years 9 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 7 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
ICRA
2005
IEEE
126views Robotics» more  ICRA 2005»
15 years 9 months ago
Global A-Optimal Robot Exploration in SLAM
— It is well-known that the Kalman filter for simultaneous localization and mapping (SLAM) converges to a fully correlated map in the limit of infinite time and data [1]. Howev...
Robert Sim, Nicholas Roy
RTAS
2010
IEEE
15 years 2 months ago
Approximate Bandwidth Allocation for Fixed-Priority-Scheduled Periodic Resources
Recent research in compositional real-time systems has focused on determination of a component’s real-time interface parameters. An important objective in interface-parameter de...
Farhana Dewan, Nathan Fisher
IPCO
1996
104views Optimization» more  IPCO 1996»
15 years 5 months ago
An Optimal, Stable Continued Fraction Algorithm
We analyse a continued fraction algorithm (abbreviated CFA) for arbitrary dimension n showing that it produces simultaneous diophantine approximations which are up to the factor 2(...
Carsten Rössner, Claus-Peter Schnorr