Sciweavers

3758 search results - page 42 / 752
» A Complete Subsumption Algorithm
Sort
View
COMPGEOM
2004
ACM
13 years 11 months ago
Complete, exact, and efficient computations with cubic curves
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
Arno Eigenwillig, Lutz Kettner, Elmar Schömer...
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
13 years 11 months ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow
MIDDLEWARE
2007
Springer
14 years 1 months ago
Garbage Collecting the Grid: A Complete DGC for Activities
Abstract. Grids are becoming more and more dynamic, running parallel applications on large scale and heterogeneous resources. Explicitly stopping a whole distributed application is...
Denis Caromel, Guillaume Chazarain, Ludovic Henrio
ISER
2000
Springer
112views Robotics» more  ISER 2000»
13 years 11 months ago
Simulation and Experimental Evaluation of Complete Sensor-Based Coverage in Rectilinear Environments
: Although sensor-based coverage is a skill which is applicable to a variety of robot tasks, its implementation has so far been limited, mostly by the physical limitations of tradi...
Zack J. Butler, Alfred A. Rizzi, Ralph L. Hollis
CAV
2009
Springer
218views Hardware» more  CAV 2009»
14 years 8 months ago
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
Abstract. We propose a novel, sound, and complete Simplex-based algorithm for solving linear inequalities over integers. Our algorithm, which can be viewed as a semantic generaliza...
Isil Dillig, Thomas Dillig, Alex Aiken