Sciweavers

1639 search results - page 287 / 328
» Anytime Heuristic Search
Sort
View
COMAD
2008
13 years 10 months ago
Discovering Interesting Subsets Using Statistical Analysis
In this paper we present algorithms for identifying interesting subsets of a given database of records. In many real life applications, it is important to automatically discover s...
Maitreya Natu, Girish Palshikar
LREC
2010
126views Education» more  LREC 2010»
13 years 10 months ago
Exploiting Scope for Shallow Discourse Parsing
We present an approach to automatically identifying the arguments of discourse connectives based on data from the Penn Discourse Treebank. Of the two arguments of connectives, cal...
Rashmi Prasad, Aravind K. Joshi, Bonnie L. Webber
ICMLA
2007
13 years 10 months ago
Learning bayesian networks consistent with the optimal branching
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Alexandra M. Carvalho, Arlindo L. Oliveira
NIPS
2007
13 years 10 months ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer
CSC
2006
13 years 10 months ago
A New Migration Model For Distributed Genetic Algorithms
Genetic algorithms are heuristic search algorithm used in science, engineering and many other areas. They are powerful but slow because of their evolutionary nature that mimics th...
Taisir Eldos