3333 search results - page 361 / 667 » Abstract Proof Search |
151
click to vote
TCBB
2008
15 years 6 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
150
click to vote
ANOR
2002
15 years 6 months ago
2002
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
143
click to vote
CG
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
150
click to vote
CBRMD
2010
15 years 5 months ago
2010
Abstract. Clinical research significantly contributes to the better understanding of diseases and their treatment. Physicians, however, could not take fully advantage of the result...
196
click to vote
CG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...