Sciweavers

5123 search results - page 422 / 1025
» Performance and Security Tradeoff
Sort
View
BELL
2006
71views more  BELL 2006»
15 years 6 months ago
Design tools for transparent optical networks
s span three levels of abstraction, from routing and reconfigurable add/drop multiplexer (ROADM) choice, to span engineering, to power dynamics simulation. Each level represents a ...
Chandra Chekuri, Paul Claisse, René-Jean Es...
188
Voted
CCR
2006
117views more  CCR 2006»
15 years 6 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
IANDC
2006
86views more  IANDC 2006»
15 years 6 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
177
Voted
CORR
2007
Springer
116views Education» more  CORR 2007»
15 years 6 months ago
On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision Detection
1 The low-SNR capacity of M-ary PSK transmission over both the additive white Gaussian noise (AWGN) and fading channels is analyzed when hard-decision detection is employed at the ...
Mustafa Cenk Gursoy
JNW
2008
81views more  JNW 2008»
15 years 6 months ago
Using Rerouting to Improve Aggregate Based Resource Allocation
This paper studies the effect of rerouting for augmenting aggregate based resource allocation in the trade-off between overhead and utilization. Aggregation is a common approach us...
Ali E. Helvaci, Coskun Cetinkaya, Mehmet Bayram Yi...