9325 search results - page 239 / 1865 » The decentralized implementability problem |
135
click to vote
AI
2006
Springer
15 years 3 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
136
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
144
click to vote
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
253
click to vote
NLP
2000
15 years 7 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
160
click to vote
AI
2008
Springer
15 years 4 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...