Sciweavers

563 search results - page 5 / 113
» A Theory of Universal Artificial Intelligence based on Algor...
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
ATAL
2004
Springer
14 years 1 months ago
Universality in Multi-Agent Systems
Much research in multi-agent systems reflects the field’s origins in classical artificial intelligence, showing how various refinements to the internal reasoning of individual a...
H. Van Dyke Parunak, Sven Brueckner, Robert Savit
TSP
2010
13 years 3 months ago
Distributed sampling of signals linked by sparse filtering: theory and applications
We study the distributed sampling and centralized reconstruction of two correlated signals, modeled as the input and output of an unknown sparse filtering operation. This is akin ...
Ali Hormati, Olivier Roy, Yue M. Lu, Martin Vetter...
ECAI
1992
Springer
14 years 19 days ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
CSCLP
2008
Springer
13 years 10 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