Sciweavers

6365 search results - page 1116 / 1273
» Fast Local Computation Algorithms
Sort
View
ICANN
2005
Springer
16 years 1 days ago
Varying the Population Size of Artificial Foraging Swarms on Time Varying Landscapes
Abstract. Swarm Intelligence (SI) is the property of a system whereby the collective behaviors of (unsophisticated) entities interacting locally with their environment cause cohere...
Carlos Fernandes, Vitorino Ramos, Agostinho C. Ros...
ICAPR
2005
Springer
16 years 1 days ago
Unsupervised Markovian Segmentation on Graphics Hardware
Abstract. This contribution shows how unsupervised Markovian segmentation techniques can be accelerated when implemented on graphics hardware equipped with a Graphics Processing Un...
Pierre-Marc Jodoin, Jean-François St-Amour,...
ATAL
2004
Springer
15 years 12 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
GCC
2004
Springer
15 years 12 months ago
End Host Multicast for Peer-to-Peer Systems
Abstract. Multicast is an effective means for conducting the cooperative P2P communications. This paper studies an algorithm to construct a scalable and efficient end host multica...
Wanqing Tu, Weijia Jia
ISPA
2004
Springer
15 years 12 months ago
An Enhanced Message Exchange Mechanism in Cluster-Based Mobile Ad Hoc Networks
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
Wei Lou, Jie Wu
« Prev « First page 1116 / 1273 Last » Next »