2116 search results - page 283 / 424 » On Probabilistic Alternating Simulations |
156
click to vote
ATAL
2005
Springer
16 years 15 days ago
2005
Springer
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
186
click to vote
GECCO
2005
Springer
16 years 14 days ago
2005
Springer
We explore several different techniques in our quest to improve the overall model performance of a genetic algorithm calibrated probabilistic cellular automata. We use the Kappa ...
192
click to vote
IPSN
2005
Springer
16 years 13 days ago
2005
Springer
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
131
Voted
SOFSEM
2005
Springer
16 years 13 days ago
2005
Springer
Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized and decentralized memory structure. In this paper, a simple range...
236
click to vote
ANTSW
2004
Springer
16 years 10 days ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...