Sciweavers

4781 search results - page 303 / 957
» Online algorithms for network design
Sort
View
COMCOM
2008
131views more  COMCOM 2008»
15 years 6 months ago
CORA: Collaborative Opportunistic Recovery Algorithm for loss controlled, delay bounded ad hoc multicast
In this paper, we present Collaborative Opportunistic Recovery Algorithm (CORA) designed for multicast multimedia applications with low loss as well as latency constraints in ad h...
Yunjung Yi, Jiejun Kong, Mario Gerla, Joon-Sang Pa...
FCCM
2006
IEEE
131views VLSI» more  FCCM 2006»
16 years 25 days ago
Packet Switched vs. Time Multiplexed FPGA Overlay Networks
— Dedicated, spatially configured FPGA interconnect is efficient for applications that require high throughput connections between processing elements (PEs) but with a limited ...
Nachiket Kapre, Nikil Mehta, Michael DeLorimier, R...
INFOCOM
2003
IEEE
16 years 1 days ago
Capacity, Delay and Mobility in Wireless Ad-Hoc Networks
Abstract— Network throughput and packet delay are two important parameters in the design and the evaluation of routing protocols for ad-hoc networks. While mobility has been show...
Nikhil Bansal, Zhen Liu
AAAI
2008
15 years 9 months ago
Bounding the False Discovery Rate in Local Bayesian Network Learning
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
Ioannis Tsamardinos, Laura E. Brown
LADC
2005
Springer
16 years 8 days ago
Quantitative Evaluation of Distributed Algorithms Using the Neko Framework: The NekoStat Extension
In this paper we present NekoStat, an extension of the Neko tool. Neko is a Java framework and a communication platform that permits rapid prototyping of distributed applications; ...
Lorenzo Falai, Andrea Bondavalli, Felicita Di Gian...