8746 search results - page 273 / 1750 » Diversifying search results |
229
click to vote
TAINN
2005
Springer
16 years 5 days 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...
183
click to vote
CP
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
157
click to vote
GCB
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. The biomedical literature grows at a tremendous rate, so that finding the relevant literature is becoming more and more difficult. To address this problem we introduce ...
164
click to vote
GECCO
2004
Springer
16 years 2 days ago
2004
Springer
Subthreshold-seeking behavior occurs when the majority of the points that an algorithm samples have an evaluation less than some target threshold. We characterize sets of functions...
180
click to vote
ICDAR
2003
IEEE
15 years 12 months ago
2003
IEEE
Classifier subset selection (CSS) from a large ensemble is an effective way to design multiple classifier systems (MCSs). Given a validation dataset and a selection criterion, the...