Sciweavers

351 search results - page 54 / 71
» Perfect Constraints Are Tractable
Sort
View
NOSSDAV
2004
Springer
14 years 1 months ago
Managing a portfolio of overlay paths
In recent years, several architectures have been proposed and developed for supporting streaming applications that take advantage of multiple paths through the network simultaneou...
Daria Antonova, Arvind Krishnamurthy, Zheng Ma, Ra...
ICDCS
1992
IEEE
13 years 11 months ago
End-to-End Scheduling to Meet Deadlines in Distributed Systems
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
Riccardo Bettati, Jane W.-S. Liu
IJCAI
2001
13 years 9 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
AAAI
1998
13 years 9 months ago
Applying Online Search Techniques to Continuous-State Reinforcement Learning
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...
Scott Davies, Andrew Y. Ng, Andrew W. Moore
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
High-SIR Transmission Capacity of Wireless Networks with General Fading and Node Distribution
In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the l...
Radha Krishna Ganti, Jeffrey G. Andrews, Martin Ha...