Sciweavers

2116 search results - page 257 / 424
» On Probabilistic Alternating Simulations
Sort
View
TON
2002
93views more  TON 2002»
15 years 4 months ago
Static and dynamic approaches to modeling end-to-end routing in circuit-switched networks
We present two routing strategies, identified herein as static least loaded routing (SLLR) and dynamic least loaded routing (DLLR). Dynamic routing in circuit-switched networks has...
Young Lee, James M. Tien
139
Voted
JBCB
2010
123views more  JBCB 2010»
15 years 3 months ago
Characterizing the Space of interatomic Distance Distribution Functions Consistent with Solution Scattering Data
: Scattering of neutrons and x-rays from molecules in solution offers alternative approaches to the studying of a wide range of macromolecular structures in their solution state w...
Paritosh A. Kavathekar, Bruce A. Craig, Alan M. Fr...
131
Voted
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 5 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
BROADNETS
2005
IEEE
15 years 10 months ago
Performance comparison of agile optical network architectures with static vs. dynamic regenerator assignment
Abstract— Agile all optical cross-connect (OXC) switches currently use an architecture in which regenerators and transceivers have pre-assigned and fixed directionality. However...
Kotikalapudi Sriram, David W. Griffith, Giuseppe D...
WSC
2000
15 years 6 months ago
SNOOPy Calendar Queue
Discrete event simulations often require a future event list structure to manage events according to their timestamp. The choice of an efficient data structure is vital to the per...
Kah Leong Tan, Ian Li-Jin Thng