125 search results - page 9 / 25 » Adaptive discretization on multidimensional continuous searc... |
108
click to vote
FUZZY
2001
Springer
15 years 4 months ago
2001
Springer
Simulated annealing is a general optimisation algorithm, based on hill-climbing. As in hill-climbing, new candidate solutions are selected from the ‘neighbourhood’ of the curre...
ICML
2010
IEEE
15 years 22 days ago
2010
IEEE
Hidden Markov Models (HMMs) are important tools for modeling sequence data. However, they are restricted to discrete latent states, and are largely restricted to Gaussian and disc...
VLDB
1997
ACM
15 years 3 months ago
1997
ACM
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
130
Voted
ICMLA
2004
15 years 1 months ago
2004
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
99
Voted
BMCBI
2010
14 years 11 months ago
2010
Background: Accurately covering the conformational space of amino acid side chains is essential for important applications such as protein design, docking and high resolution stru...