Sciweavers

3514 search results - page 564 / 703
» A search space
Sort
View
UAI
2004
14 years 2 days ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
AIPS
2000
14 years 1 days ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
FTCS
1998
114views more  FTCS 1998»
14 years 1 days ago
Verification of a Safety-Critical Railway Interlocking System with Real-Time Constraints
Ensuring the correctness of computer systems used in lifecritical applications is very difficult. The most commonly used verification methods, simulation and testing, are not exha...
Vicky Hartonas-Garmhausen, Sérgio Vale Agui...
AAAI
1993
14 years 20 hour ago
Relative Utility of EBG based Plan Reuse in Partial Ordering vs. Total Ordering Planning
This paper provides a systematic analysisof the relativeutility of basingEBG based plan reuse techniques in partial ordering vs. total ordering planning frameworks. We separate th...
Subbarao Kambhampati, Jengchin Chen
CEC
2010
IEEE
13 years 11 months ago
Two novel Ant Colony Optimization approaches for Bayesian network structure learning
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
Yanghui Wu, John A. W. McCall, David W. Corne