Sciweavers

17951 search results - page 3154 / 3591
» Network Coding Applications
Sort
View
KI
2010
Springer
15 years 5 months ago
Soft Evidential Update via Markov Chain Monte Carlo Inference
The key task in probabilistic reasoning is to appropriately update one’s beliefs as one obtains new information in the form of evidence. In many application settings, however, th...
Dominik Jain, Michael Beetz
LATIN
2010
Springer
15 years 5 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
MIDDLEWARE
2010
Springer
15 years 5 months ago
Automatically Generating Symbolic Prefetches for Distributed Transactional Memories
Abstract. Developing efficient distributed applications while managing complexity can be challenging. Managing network latency is a key challenge for distributed applications. We ...
Alokika Dash, Brian Demsky
TON
2010
158views more  TON 2010»
15 years 5 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 5 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu
« Prev « First page 3154 / 3591 Last » Next »