Sciweavers

656 search results - page 77 / 132
» Complexity of finite-horizon Markov decision process problem...
Sort
View
CSCLP
2008
Springer
15 years 8 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
ICML
1998
IEEE
16 years 7 months ago
Value Function Based Production Scheduling
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
Jeff G. Schneider, Justin A. Boyan, Andrew W. Moor...
DIALM
2000
ACM
112views Algorithms» more  DIALM 2000»
15 years 10 months ago
A decision-theoretic approach to resource allocation in wireless multimedia networks
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless c...
Zygmunt J. Haas, Joseph Y. Halpern, Erran L. Li, S...
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
15 years 10 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
ATAL
2009
Springer
16 years 23 days ago
Improving adjustable autonomy strategies for time-critical domains
As agents begin to perform complex tasks alongside humans as collaborative teammates, it becomes crucial that the resulting humanmultiagent teams adapt to time-critical domains. I...
Nathan Schurr, Janusz Marecki, Milind Tambe