Sciweavers

18 search results - page 3 / 4
» Flow Faster: Efficient Decision Algorithms for Probabilistic...
Sort
View
TON
2008
125views more  TON 2008»
13 years 6 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
HRI
2007
ACM
13 years 10 months ago
Efficient model learning for dialog management
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
Finale Doshi, Nicholas Roy
ATAL
2006
Springer
13 years 10 months ago
Scalable and reliable data delivery in mobile ad hoc sensor networks
This paper studies scalable data delivery algorithms in mobile ad hoc sensor networks with node and link failures. Many algorithms have been developed for data delivery and fusion...
Bin Yu, Paul Scerri, Katia P. Sycara, Yang Xu, Mic...
CCR
2002
62views more  CCR 2002»
13 years 6 months ago
An enforced inter-admission delay performance-driven connection admission control algorithm
Connection Admission Control (CAC) is an important function in a computer network that supports Quality of Service (QoS). The function of CAC is to decide whether a new connection...
Stanislav Belenki
HUMAN
2003
Springer
13 years 11 months ago
Admission Control for TCP Connections in QoS IP Network
The paper describes a new admission control (AC) algorithm for greedy TCP connections. The algorithm has passed positive tests in preproduction QoS IP network [2], developed inside...
Wojciech Burakowski, Halina Tarasiuk