Sciweavers

118 search results - page 3 / 24
» Implementation of State Elimination Using Heuristics
Sort
View
AAAI
2006
14 years 11 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
CP
2007
Springer
15 years 3 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
SPIN
2004
Springer
15 years 2 months ago
Explicit State Model Checking with Hopper
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
Michael Jones, Eric Mercer
IBERAMIA
2004
Springer
15 years 2 months ago
Constrainedness and Redundancy by Constraint Ordering
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
Miguel A. Salido, Federico Barber
BMCBI
2010
101views more  BMCBI 2010»
14 years 9 months ago
Hidden Markov model speed heuristic and iterative HMM search procedure
Background: Profile hidden Markov models (profile-HMMs) are sensitive tools for remote protein homology detection, but the main scoring algorithms, Viterbi or Forward, require con...
L. Steven Johnson, Sean R. Eddy, Elon Portugaly