Sciweavers

1529 search results - page 260 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
AIPS
2010
13 years 10 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
BMCBI
2006
116views more  BMCBI 2006»
13 years 9 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
COMPGEOM
2011
ACM
13 years 12 days ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
IJRR
2008
100views more  IJRR 2008»
13 years 8 months ago
Comparing the Power of Robots
Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing a...
Jason M. O'Kane, Steven M. LaValle
COMPGEOM
2006
ACM
14 years 2 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...