1071 search results - page 82 / 215 » Protein structure search and local structure characterizatio... |
SAGA
2001
Springer
14 years 5 days ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
BMCBI
2006
13 years 7 months ago
2006
Background: Many biological processes involve the physical interaction between protein domains. Understanding these functional associations requires knowledge of the molecular str...
JSW
2006
13 years 7 months ago
2006
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...
TAINN
2005
Springer
14 years 1 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
AAAI
2008
13 years 10 months ago
2008
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...