434 search results - page 25 / 87 » Constraint-Based Combinators for Local Search |
140
Voted
AI
2003
Springer
15 years 10 months ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
113
Voted
MVA
2002
15 years 4 months ago
2002
Thispaper addresses theproblem in mug shot searching in suspect database. The objective is to improve the eficiency of the suspect identificationprocess. The input is a sketch con...
115
Voted
OTM
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we describe a novel methodology for retrieving and combining information from multiple ontologies for the medical domain. In the last decades the number and diversity...
149
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
121
click to vote
ACG
2006
Springer
15 years 11 months ago
2006
Springer
Seki is a situation of coexistence in the game of Go, where neither player can profitably capture the opponent’s stones. This paper presents a new method for deciding whether an...