Sciweavers

520 search results - page 59 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
SAC
2010
ACM
14 years 3 months ago
MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
David Portugal, Rui Rocha
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
13 years 10 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
14 years 2 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
14 years 4 days ago
Smart crossover operator with multiple parents for a Pittsburgh learning classifier system
This paper proposes a new smart crossover operator for a Pittsburgh Learning Classifier System. This operator, unlike other recent LCS approaches of smart recombination, does not ...
Jaume Bacardit, Natalio Krasnogor
CVPR
2007
IEEE
14 years 10 months ago
A Topological Approach to Hierarchical Segmentation using Mean Shift
Mean shift is a popular method to segment images and videos. Pixels are represented by feature points, and the segmentation is driven by the point density in feature space. In thi...
Frédo Durand, Sylvain Paris