569 search results - page 31 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The main purpose of this paper is to propose a Multi-Agent Autonomic and Bio-Inspired based framework with selfmanaging capabilities to solve complex scheduling problems using coo...
ICAPR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the seq...
EMMCVPR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
We propose a very efficient numerical algorithm for minimizing certain curvature dependent functionals that appear in a variety of well known variational models of image processin...