Sciweavers

39 search results - page 8 / 8
» An Asynchronous Routing Algorithm for Clos Networks
Sort
View
OPODIS
2008
13 years 6 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
ICML
1996
IEEE
14 years 6 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
DEBS
2009
ACM
13 years 6 months ago
Towards efficient event aggregation in a decentralized publish-subscribe system
Recently, decentralized publish-subscribe (pub-sub) systems have gained popularity as a scalable asynchronous messaging paradigm over wide-area networks. Most existing pub-sub sys...
Jianxia Chen, Lakshmish Ramaswamy, David Lowenthal