Sciweavers

101 search results - page 6 / 21
» Using Parsimony to Guide Maximum Likelihood Searches
Sort
View
ETAI
2000
84views more  ETAI 2000»
14 years 9 months ago
Learning Stochastic Logic Programs
Stochastic logic programs combine ideas from probabilistic grammars with the expressive power of definite clause logic; as such they can be considered as an extension of probabili...
Stephen Muggleton
WABI
2009
Springer
117views Bioinformatics» more  WABI 2009»
15 years 4 months ago
A Simulation Study Comparing Supertree and Combined Analysis Methods Using SMIDGen
Background: Supertree methods comprise one approach to reconstructing large molecular phylogenies given multi-marker datasets: trees are estimated on each marker and then combined...
M. Shel Swenson, François Barbançon,...
77
Voted
IPM
2000
142views more  IPM 2000»
14 years 9 months ago
Adapting a diagnostic problem-solving model to information retrieval
In this paper, a competition-based connectionist model for diagnostic problem-solving is adapted to information retrieval. In this model, we treat documents as \disorders" an...
Inien Syu, Sheau-Dong Lang
CP
2003
Springer
15 years 2 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
80
Voted
JCB
2006
140views more  JCB 2006»
14 years 9 months ago
HAPLOFREQ-Estimating Haplotype Frequencies Efficiently
A commonly used tool in disease association studies is the search for discrepancies between the haplotype distribution in the case and control populations. In order to find this d...
Eran Halperin, Elad Hazan