𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Local search with constraint propagation and conflict-based heuristics

✍ Scribed by Narendra Jussien; Olivier Lhomme

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
171 KB
Volume
139
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Continuous speech recognition based on A
Continuous speech recognition based on A* search with word-pair constraint as heuristics
✍ Tatsuya Kawahara; Shuji Doshita; Shinji Matsumoto 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 737 KB

## Abstract This paper proposes an A\* search algorithm for continuous speech recognition using phoneme HMM and Context‐Free (LR) parser. This best‐first search evaluates each sentence hypothesis with the matching score plus the heuristic score of the unsearched part. Heuristics computation is base

Targeting the Cell Broadband Engine for
Targeting the Cell Broadband Engine for constraint-based local search
✍ Daniel Diaz; Salvador Abreu; Philippe Codognet 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 674 KB

## SUMMARY We investigated the use of the Cell Broadband Engine (Cell/BE) for constraint‐based local search and combinatorial optimization applications. We presented a parallel version of a constraint‐based local search algorithm that was chosen because it fits very well the Cell/BE architecture be

An iterated local search algorithm for l
An iterated local search algorithm for learning Bayesian networks with restarts based on conditional independence tests
✍ Luis M. De Campos; Juan M. Fernández-Luna; J. Miguel Puerta 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

A common approach for learning Bayesian networks (BNs) from data is based on the use of a scoring metric to evaluate the fitness of any given candidate network to the data and a method to explore the search space, which usually is the set of directed acyclic graphs (DAGs). The most efficient search