Sciweavers

841 search results - page 139 / 169
» Approximability of Minimum AND-Circuits
Sort
View
CIC
2004
118views Communications» more  CIC 2004»
13 years 9 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
IIS
2003
13 years 9 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
WSC
2004
13 years 9 months ago
Automation of Human Decision Processes for Route Completion for Airspace Design Analysis
This paper describes an algorithm for approximating missing data in air traffic routes thereby allowing the lengths of different routes to be compared for our simulation analyses....
Lisa A. Schaefer
NIPS
1996
13 years 9 months ago
Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems
In cellular telephone systems, an important problem is to dynamically allocate the communication resource channels so as to maximize service in a stochastic caller environment. Th...
Satinder P. Singh, Dimitri P. Bertsekas
COMGEO
2008
ACM
13 years 7 months ago
Optimal location of transportation devices
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
Jean Cardinal, Sébastien Collette, Ferran H...