Sciweavers

2100 search results - page 268 / 420
» Fundamentals of the problem
Sort
View
ATAL
2006
Springer
14 years 2 months ago
Solving POMDPs using quadratically constrained linear programs
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
Christopher Amato, Daniel S. Bernstein, Shlomo Zil...
BIRTHDAY
2012
Springer
12 years 6 months ago
Model Transformation By-Example: A Survey of the First Wave
Abstract. Model-Driven Engineering (MDE) places models as firstclass artifacts throughout the software lifecycle. In this context, model transformations are crucial for the succes...
Gerti Kappel, Philip Langer, Werner Retschitzegger...
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
12 years 24 days ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
ICRA
2002
IEEE
188views Robotics» more  ICRA 2002»
14 years 3 months ago
Hybrid Mobile Robot Localization using Switching State-Space Models
—This article describes a rigorous and complete framework for the simultaneous localization and map building problem for mobile robots: the symmetries and perturbations map (SPma...
Haris Baltzakis, Panos E. Trahanias
STACS
2009
Springer
14 years 5 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...