Sciweavers

923 search results - page 118 / 185
» On the Topology of Discrete Strategies
Sort
View
IPPS
2010
IEEE
13 years 7 months ago
Scalability analysis of embarassingly parallel applications on large clusters
This work presents a scalability analysis of embarrassingly parallel applications running on cluster and multi-cluster machines. Several applications can be included in this catego...
Fabrício Alves Barbosa da Silva, Hermes Sen...
CN
2011
129views more  CN 2011»
13 years 4 months ago
Decapitation of networks with and without weights and direction: The economics of iterated attack and defense
Vulnerability of networks against one-shot decapitation attacks has been addressed several times in the literature. A first study on how a network can best defend itself by reple...
Josep Domingo-Ferrer, Úrsula Gonzále...
TELSYS
2011
212views Education» more  TELSYS 2011»
13 years 4 months ago
Survivability and reliability of a composite-star transport network with disconnected core switches
Abstract This paper deals with the design and dimensioning of a novel survivable optical network structure, called Petaweb, that can reach a total capacity of several Pb/s (1015 bi...
Stefano Secci, Brunilde Sansò
ICML
2004
IEEE
14 years 10 months ago
Learning associative Markov networks
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
Benjamin Taskar, Vassil Chatalbashev, Daphne Kolle...
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 6 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald