Sciweavers

5084 search results - page 693 / 1017
» Proving Possibility Properties
Sort
View
WSC
2004
15 years 8 months ago
An Adaptive Approach to Fast Simulation of Traffic Groomed Optical Networks
In this paper, we consider the fast simulation of traffic groomed optical networks, in which multiple sub-rate traffic streams may be carried on the same wavelength. For real-size...
Chih-Chieh Hsu, Michael Devetsikiotis
ICMAS
2000
15 years 8 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 8 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
NIPS
1996
15 years 8 months ago
Reinforcement Learning for Mixed Open-loop and Closed-loop Control
Closed-loop control relies on sensory feedback that is usually assumed to be free. But if sensing incurs a cost, it may be coste ective to take sequences of actions in open-loop m...
Eric A. Hansen, Andrew G. Barto, Shlomo Zilberstei...
SOSP
1993
ACM
15 years 8 months ago
Handling Audio and Video Streams in a Distributed Environment
Handling audio and video in a digital environment requires timely delivery of data. This paper describes the principles adopted in the design of the Pandora networked multi-media ...
Alan Jones, Andrew Hopper