Sciweavers

160 search results - page 24 / 32
» Planning Graph Heuristics for Belief Space Search
Sort
View
UAI
2001
14 years 11 months ago
Improved learning of Bayesian networks
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
Tomás Kocka, Robert Castelo
AI
1999
Springer
14 years 9 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
15 years 3 months ago
Mining breast cancer data with XCS
In this paper, we describe the use of a modern learning classifier system to a data mining task. In particular, in collaboration with a medical specialist, we apply XCS to a prima...
Faten Kharbat, Larry Bull, Mohammed Odeh
SCAI
2008
14 years 11 months ago
Troubleshooting when Action Costs are Dependent with Application to a Truck Engine
We propose a troubleshooting algorithm that can troubleshoot systems with dependent action costs. When actions are performed they may change the way the system is decomposed and af...
Håkan Warnquist, Mattias Nyberg, Petter S&au...
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
15 years 10 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...