10051 search results - page 277 / 2011 » A Dynamic Separator Algorithm |
160
click to vote
CSCLP
2004
Springer
16 years 2 days ago
2004
Springer
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
329
click to vote
ICC
2011
IEEE
14 years 6 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
210
click to vote
GECCO
2007
Springer
16 years 26 days 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...
155
click to vote
ICIAP
2003
ACM
16 years 6 months ago
2003
ACM
We propose a Dynamic Face Recognition Committee Machine (DFRCM) consisting of five well-known state-of-the-art algorithms in this paper. In previous work, we have developed a stat...
214
Voted
CCGRID
2008
IEEE
15 years 8 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...