Sciweavers

1095 search results - page 192 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
ICRA
2006
IEEE
75views Robotics» more  ICRA 2006»
15 years 3 months ago
Thinning-based Topological Exploration using Position Probability of Topological Nodes
- Exploration is the fundamental task of guiding a robot autonomously during mapping so that it covers the entire environment with its sensors. In the frontier-based exploration, a...
Tae-Bum Kwon, Jae-Bok Song
AIPS
2010
14 years 11 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...
GIS
2004
ACM
15 years 10 months ago
A partial join approach for mining co-location patterns
Spatial co-location patterns represent the subsets of events whose instances are frequently located together in geographic space. We identified the computational bottleneck in the...
Jin Soung Yoo, Shashi Shekhar
RECOMB
2005
Springer
15 years 10 months ago
Information Theoretic Approaches to Whole Genome Phylogenies
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
David Burstein, Igor Ulitsky, Tamir Tuller, Benny ...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking