Sciweavers

313 search results - page 31 / 63
» Complete Local Search with Memory
Sort
View
AIPS
2006
15 years 7 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
AMAI
2004
Springer
15 years 11 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
BMCBI
2005
108views more  BMCBI 2005»
15 years 5 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
VISUALIZATION
2000
IEEE
15 years 10 months ago
Extracting regions of interest applying a local watershed transformation
In this paper, we present a new technique for extracting regions of interest (ROI) applying a local watershed transformation. The proposed strategy for computing catchment basins ...
Stanislav L. Stoev, Wolfgang Straßer
ICML
2010
IEEE
15 years 7 months ago
Bottom-Up Learning of Markov Network Structure
The structure of a Markov network is typically learned using top-down search. At each step, the search specializes a feature by conjoining it to the variable or feature that most ...
Jesse Davis, Pedro Domingos