Sciweavers

2924 search results - page 210 / 585
» Lower Bounds in Distributed Computing
Sort
View
ICPADS
1994
IEEE
15 years 7 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
STACS
2009
Springer
15 years 10 months ago
The Price of Anarchy in Cooperative Network Creation Games
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid M...
131
Voted
ORDER
2002
107views more  ORDER 2002»
15 years 3 months ago
Order Dimension, Strong Bruhat Order and Lattice Properties for Posets
We determine the order dimension of the strong Bruhat order on finite Coxeter groups of types A, B and H. The order dimension is determined using a generalization of a theorem of D...
Nathan Reading
IPPS
2000
IEEE
15 years 7 months ago
Support for Recoverable Memory in the Distributed Virtual Communication Machine
The Distributed Virtual Communication Machine (DVCM) is a software communication architecture for clusters of workstations equipped with programmable network interfaces (NIs) for ...
Marcel-Catalin Rosu, Karsten Schwan
116
Voted
PERCOM
2009
ACM
15 years 10 months ago
Distributed Detection of Replicas with Deployment Knowledge in Wireless Sensor Networks
—Due to the unattended nature of wireless sensor networks, an adversary can easily capture and compromise sensor nodes, generate replicas of those compromised nodes, and mount a ...
Jun-Won Ho, Donggang Liu, Matthew Wright, Sajal K....