Sciweavers

297 search results - page 2 / 60
» J-MADeM, a market-based model for complex decision problems
Sort
View
ADG
2000
Springer
110views Mathematics» more  ADG 2000»
13 years 9 months ago
Decision Complexity in Dynamic Geometry
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
Ulrich Kortenkamp, Jürgen Richter-Gebert
UAI
2000
13 years 6 months ago
The Complexity of Decentralized Control of Markov Decision Processes
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 5 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha
ATAL
2007
Springer
13 years 11 months ago
Coordination and Sociability for Intelligent Virtual Agents
This paper presents a multi-agent framework designed to simulate synthetic humans that properly balance task oriented and social behaviors. The work presented in this paper focuses...
Francisco Grimaldo, Miguel Lozano, Fernando Barber
IEEEARES
2006
IEEE
13 years 11 months ago
Diagnosis of Complex Systems Using Ant Colony Decision Petri Nets
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...
Calin Ciufudean, Adrian Graur, Constantin Filote, ...