Sciweavers

569 search results - page 38 / 114
» An Efficient Algorithm for Solving Dynamic Complex DCOP Prob...
Sort
View
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
13 years 12 months ago
Dynamic Motion Planning in Low Obstacle Density Environments
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...
CDC
2010
IEEE
150views Control Systems» more  CDC 2010»
13 years 2 months ago
Nonlinear hybrid system identification with kernel models
Abstract-- This paper focuses on the identification of nonlinear hybrid systems involving unknown nonlinear dynamics. The proposed method extends the framework of [1] by introducin...
Fabien Lauer, Gérard Bloch, René Vid...
ATMOS
2007
177views Optimization» more  ATMOS 2007»
13 years 9 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
EGH
2005
Springer
14 years 1 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 8 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf