Sciweavers

672 search results - page 3 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....
FCT
2003
Springer
14 years 20 days ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
CSR
2009
Springer
13 years 8 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
ATAL
2006
Springer
13 years 11 months ago
Exact solutions of interactive POMDPs using behavioral equivalence
We present a method for transforming the infinite interactive state space of interactive POMDPs (I-POMDPs) into a finite one, thereby enabling the computation of exact solutions. ...
Bharaneedharan Rathnasabapathy, Prashant Doshi, Pi...
ICSE
2003
IEEE-ACM
14 years 7 months ago
Software Engineering Overlaps with Human-Computer Interaction: A Natural Evolution
It is argued that overlap between the Software Engineering and Human-Computer Interaction disciplines is part of a natural evolution that has been developing throughout the histor...
Allen E. Milewski