Sciweavers

8080 search results - page 188 / 1616
» From Computer Networks to Agent Networks
Sort
View
131
Voted
NETWORKS
2008
15 years 3 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
121
Voted
ESA
2009
Springer
111views Algorithms» more  ESA 2009»
15 years 10 months ago
Exact and Approximate Equilibria for Optimal Group Network Formation
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
Elliot Anshelevich, Bugra Caskurlu
125
Voted
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 3 months ago
A distributed file system for a wide-area high performance computing infrastructure
We describe our work in implementing a wide-area distributed file system for the NSF TeraGrid. The system, called XUFS, allows private distributed name spaces to be created for tr...
Edward Walker
AINA
2008
IEEE
15 years 5 months ago
3MOKAN: A Novel Mobility Management Mechanism Based on Keeping Alternative Nodes
A mobile ad hoc network (MANET) is a network without any predefined infrastructure in which every node not only enjoys the services from the network, but serves the network as a r...
Mahmood Hasanlou, Ebrahim Fazli, Ali Movaghar, Hos...
148
Voted
ACRI
2010
Springer
15 years 5 months ago
Network Decontamination with Temporal Immunity by Cellular Automata
Abstract. Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team...
Yassine Daadaa, Paola Flocchini, Nejib Zaguia