569 search results - page 35 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
IJCAI
2003
13 years 9 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
CIMCA
2008
IEEE
14 years 2 months ago
2008
IEEE
—The computational grid provides a promising platform for the deployment of various high-performance computing applications. In computational grid, an efficient scheduling of tas...
CGF
2008
13 years 7 months ago
2008
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
IJACTAICIT
2010
13 years 5 months ago
2010
In this article, a hybrid optimization method has been proposed consisting of modified ant colony systems (ACSs) and constrained nonlinear programming (NLP) to solve the problems ...