Sciweavers

689 search results - page 48 / 138
» Encapsulation theory fundamentals
Sort
View
AUSAI
1999
Springer
14 years 2 months ago
Minimal Belief Change and Pareto-Optimality
This paper analyzes the notion of a minimal belief change that incorporates new information. I apply the fundamental decisiontheoretic principle of Pareto-optimality to derive a no...
Oliver Schulte
ECAI
2006
Springer
14 years 1 months ago
An Efficient Upper Approximation for Conditional Preference
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
Nic Wilson
AAAI
2008
14 years 9 days ago
Bounding the False Discovery Rate in Local Bayesian Network Learning
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
Ioannis Tsamardinos, Laura E. Brown
IJCAI
1989
13 years 11 months ago
Minimal Change and Maximal Coherence: A Basis for Belief Revision and Reasoning about Actions
The study of belief revision and reasoning about actions have been two of the most active areas of research in AI. Both these areas involve reasoning about change. However very li...
Anand S. Rao, Norman Y. Foo
ESA
2010
Springer
136views Algorithms» more  ESA 2010»
13 years 11 months ago
Fast Minor Testing in Planar Graphs
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignas...