Sciweavers

1258 search results - page 154 / 252
» Architecture-driven Problem Decomposition
Sort
View
RIA
2006
60views more  RIA 2006»
13 years 9 months ago
GACS : une approche ascendante pour la coordination spatiale
ABSTRACT. The design of spatial coordination mechanisms for dynamical and continuous multiagent setting is a difficult challenge. While the top-down decomposition approach is ineff...
Fabien Flacher, Olivier Sigaud
JDA
2008
122views more  JDA 2008»
13 years 8 months ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
13 years 7 months ago
Optimal coverage of a known arbitrary environment
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
Raphael Mannadiar, Ioannis M. Rekleitis
IFIP12
2009
13 years 6 months ago
Mining Retail Transaction Data for Targeting Customers with Headroom - A Case Study
We outline a method to model customer behavior from retail transaction data. In particular, we focus on the problem of recommending relevant products to consumers. Addressing this ...
Madhu Shashanka, Michael Giering
SIAMIS
2011
13 years 3 months ago
A New Geometric Metric in the Space of Curves, and Applications to Tracking Deforming Objects by Prediction and Filtering
We define a novel metric on the space of closed planar curves which decomposes into three intuitive components. According to this metric centroid translations, scale changes and ...
Ganesh Sundaramoorthi, Andrea Mennucci, Stefano So...