Sciweavers

2990 search results - page 481 / 598
» Hidden Markov processes
Sort
View
TIT
2002
57views more  TIT 2002»
15 years 6 months ago
Writing sequences on the plane
The problem of arranging two-dimensional arrays of data into one-dimensional sequences comes up in image processing, color quantization, and optical and magnetic data recording. A ...
Emina Soljanin
TRANSCI
2002
106views more  TRANSCI 2002»
15 years 6 months ago
The Stochastic Inventory Routing Problem with Direct Deliveries
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Sav...
QUESTA
2007
92views more  QUESTA 2007»
15 years 5 months ago
Estimation for queues from queue length data
We consider the estimation of arrival and service rates for queues based on queue length data collected at successive, not necessarily equally spaced, time points. In particular, ...
J. V. Ross, T. Taimre, Philip K. Pollett
GLOBECOM
2010
IEEE
15 years 4 months ago
Admission Control and Channel Allocation for Supporting Real-Time Applications in Cognitive Radio Networks
Abstract--Proper admission control in cognitive radio networks is critical in providing QoS guarantees to secondary unlicensed users. In this paper, we study the admission control ...
Feng Wang, Junhua Zhu, Jianwei Huang, Yuping Zhao
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick