Sciweavers

2916 search results - page 528 / 584
» Generating Rule Sets from Model Trees
Sort
View
AAAI
2004
14 years 11 months ago
Analogical Path Planning
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
Saul Simhon, Gregory Dudek
AAAI
2000
14 years 11 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
UAI
1996
14 years 11 months ago
Efficient Approximations for the Marginal Likelihood of Incomplete Data Given a Bayesian Network
We discuss Bayesian methods for learning Bayesian networks when data sets are incomplete. In particular, we examine asymptotic approximations for the marginal likelihood of incomp...
David Maxwell Chickering, David Heckerman
DSD
2010
IEEE
110views Hardware» more  DSD 2010»
14 years 10 months ago
A Predictable Multiprocessor Design Flow for Streaming Applications with Dynamic Behaviour
—The design of new embedded systems is getting more and more complex as more functionality is integrated into these systems. To deal with the design complexity, a predictable des...
Sander Stuijk, Marc Geilen, Twan Basten
BMCBI
2006
180views more  BMCBI 2006»
14 years 10 months ago
Building multiclass classifiers for remote homology detection and fold recognition
Motivation Protein remote homology prediction and fold recognition are central problems in computational biology. Supervised learning algorithms based on support vector machines a...
Huzefa Rangwala, George Karypis