Sciweavers

1097 search results - page 171 / 220
» Testing Graph Isomorphism
Sort
View
IJCAI
2003
15 years 3 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
WOB
2004
134views Bioinformatics» more  WOB 2004»
15 years 3 months ago
Reconstruction of Phylogenetic Trees using the Ant Colony Optimization Paradigm
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
Heitor S. Lopes, Mauricio Perretto
82
Voted
NIPS
2003
15 years 3 months ago
Bias-Corrected Bootstrap and Model Uncertainty
The bootstrap has become a popular method for exploring model (structure) uncertainty. Our experiments with artificial and realworld data demonstrate that the graphs learned from...
Harald Steck, Tommi Jaakkola
FLAIRS
2000
15 years 3 months ago
Independence Semantics for BKBs
Bayesian KnowledgeBases (BKB)are a rule-based probabilistic modelthat extend BayesNetworks(BN), by allowing context-sensitive independenceand cycles in the directed graph. BKBshav...
Solomon Eyal Shimony, Eugene Santos Jr., Tzachi Ro...
PSTV
1993
123views Hardware» more  PSTV 1993»
15 years 3 months ago
On the Verification of Temporal Properties
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
Patrice Godefroid, Gerard J. Holzmann