Sciweavers

203 search results - page 9 / 41
» Decision Tree Pruning as a Search in the State Space
Sort
View
GCB
1997
Springer
74views Biometrics» more  GCB 1997»
13 years 11 months ago
Using constraint programming for lattice protein folding
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
Rolf Backofen
CP
2007
Springer
14 years 1 months ago
A Constraint Store Based on Multivalued Decision Diagrams
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
Henrik Reif Andersen, Tarik Hadzic, John N. Hooker...
CG
1998
Springer
13 years 11 months ago
Relevance Cuts: Localizing the Search
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
Andreas Junghanns, Jonathan Schaeffer
ISMB
2000
13 years 9 months ago
Accelerating Protein Classification Using Suffix Trees
Position-specific scoring matrices have been used extensively to recognize highly conserved protein regions. We present a method for accelerating these searches using a suffix tre...
Bogdan Dorohonceanu, Craig G. Nevill-Manning
ICML
1994
IEEE
13 years 11 months ago
Learning Without State-Estimation in Partially Observable Markovian Decision Processes
Reinforcement learning (RL) algorithms provide a sound theoretical basis for building learning control architectures for embedded agents. Unfortunately all of the theory and much ...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...