8540 search results - page 296 / 1708 » The Dynamic Servers Problem |
117
Voted
NIPS
2007
15 years 5 months ago
2007
The control of high-dimensional, continuous, non-linear dynamical systems is a key problem in reinforcement learning and control. Local, trajectory-based methods, using techniques...
141
click to vote
AAAI
2000
15 years 5 months ago
2000
This paper addresses the problem of tracking and diagnosing complex systems with mixtures of discrete and continuous variables. This problem is a difficult one, particularly when ...
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Given a probability distribution over a set of n words to be transmitted, the Huffman Coding problem is to find a minimal-cost prefix free code for transmitting those words. The b...
144
click to vote
JCP
2007
15 years 3 months ago
2007
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
267
click to vote
ICC
2011
IEEE
14 years 3 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...