Sciweavers

689 search results - page 101 / 138
» Encapsulation theory fundamentals
Sort
View
ECIS
2003
15 years 3 months ago
Usability in social action: reinterpreting effectiveness efficiency and satisfaction
One of the most important qualities related to the use of information systems is arguably the usability achieved in actual use-situations. Three central criteria for usability as ...
Pär J. Ågerfalk, Owen Eriksson
UAI
2003
15 years 3 months ago
Updating with incomplete observations
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...
Gert de Cooman, Marco Zaffalon
105
Voted
AAAI
1990
15 years 2 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
ATAL
2010
Springer
15 years 2 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham
ATAL
2010
Springer
15 years 2 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