413 search results - page 47 / 83 » Synthesis of Distributed Algorithms Using Asynchronous Autom... |
136
click to vote
FLAIRS
2004
15 years 3 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
103
click to vote
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
Many of the optimization problems from the real world are multiobjective in nature, and the reference algorithm for multiobjective optimization is NSGA-II. Frequently, these probl...
131
click to vote
PDCAT
2009
Springer
15 years 8 months ago
2009
Springer
—In the crash-recovery failure model of asynchronous distributed systems, processes can temporarily stop to execute steps and later restart their computation from a predefined l...
111
Voted
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper we address the physical parallelization of a very efficient genetic algorithm (GA) known as gradual distributed real-coded GA (GD-RCGA). This search model naturally...
109
click to vote
CAV
1993
Springer
15 years 6 months ago
1993
Springer
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...