Sciweavers

13041 search results - page 212 / 2609
» Simulating space and time
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 5 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
ICDCS
2007
IEEE
15 years 11 months ago
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
130
Voted
AAAI
2007
15 years 7 months ago
Action-Space Partitioning for Planning
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
Natalia Hernandez-Gardiol, Leslie Pack Kaelbling
COMPGEOM
1997
ACM
15 years 9 months ago
Cylindrical Static and Kinetic Binary Space Partitions
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Mural...
121
Voted
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
15 years 11 months ago
Hardness of Embedding Metric Spaces of Equal Size
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
Subhash Khot, Rishi Saket