Sciweavers

104 search results - page 18 / 21
» Graph Searching, Elimination Trees, and a Generalization of ...
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
14 years 9 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
DAC
2005
ACM
15 years 10 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
IWCLS
2007
Springer
15 years 3 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull
67
Voted
WWW
2009
ACM
15 years 10 months ago
A flight meta-search engine with metamorph
We demonstrate a flight meta-search engine that is based on the Metamorph framework. Metamorph provides mechanisms to model web forms together with the interactions which are need...
Bernhard Krüpl, Wolfgang Holzinger, Yansen Da...
WWW
2006
ACM
15 years 10 months ago
Web ontology segmentation: analysis, classification and use
Ontologies are at the heart of the semantic web. They define the concepts and relationships that make global interoperability possible. However, as these ontologies grow in size t...
Julian Seidenberg, Alan L. Rector