Sciweavers

9949 search results - page 402 / 1990
» On the Network Complexity of Selection
Sort
View
ISLPED
2004
ACM
153views Hardware» more  ISLPED 2004»
16 years 1 months ago
Any-time probabilistic switching model using bayesian networks
Modeling and estimation of switching activities remain to be important problems in low-power design and fault analysis. A probabilistic Bayesian Network based switching model can ...
Shiva Shankar Ramani, Sanjukta Bhanja
IEEEAMS
2002
IEEE
16 years 17 days ago
A Framework for Application-Specific Customization of Network Services
We propose a network service framework where common network functions such as routing and multicast can be customized on a per-application basis. Network service customization is ...
Sriram Ramabhadran, Joseph Pasquale
UAI
1996
15 years 9 months ago
Efficient Search-Based Inference for noisy-OR Belief Networks: TopEpsilon
Inference algorithms for arbitrary belief networks are impractical for large, complex belief networks. Inference algorithms for specialized classes of belief networks have been sh...
Kurt Huang, Max Henrion
ALGOSENSORS
2010
Springer
15 years 6 months ago
MSDR-D Network Localization Algorithm
Abstract. We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. T...
Kevin Coogan, Varun Khare, Stephen G. Kobourov, Ba...
ICC
2007
IEEE
111views Communications» more  ICC 2007»
16 years 1 months ago
TDM Emulation in Packet-Switched Networks
— Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). In this work, we study the problem of desig...
George N. Rouskas, Nikhil Baradwaj