Sciweavers

1182 search results - page 163 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
BROADNETS
2004
IEEE
14 years 19 days ago
Fault Management with Fast Restoration for Optical Burst Switched Networks
This paper studies the important fault management issue with focus on the fast restoration mechanisms for Optical Burst Switched (OBS) networks. In order to reduce the burst losse...
Yufeng Xin, Jing Teng, Gigi Karmous-Edwards, Georg...
IJCAI
1989
13 years 10 months ago
Preprocessing Search Spaces for Branch and Bound Search
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
Qiang Yang, Dana S. Nau
GLOBECOM
2007
IEEE
13 years 9 months ago
Cooperative Beamforming for Wireless Ad Hoc Networks
—Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of mak...
Lun Dong, Athina P. Petropulu, H. Vincent Poor
TON
1998
87views more  TON 1998»
13 years 8 months ago
Adaptive hybrid clock discipline algorithm for the network time protocol
This paper describes the analysis, implementation and performance of a new algorithm engineered to discipline a computer clock to a source of standard time, such as a GPS receiver...
David L. Mills
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 8 months ago
Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i...
Enrico Paolini, Gianluigi Liva, Michela Varrella, ...