Sciweavers

727 search results - page 122 / 146
» Private approximation of search problems
Sort
View
DAS
2006
Springer
14 years 1 months ago
Combining Multiple Classifiers for Faster Optical Character Recognition
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
Kumar Chellapilla, Michael Shilman, Patrice Simard
ESANN
2003
13 years 11 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer
JUCS
2002
131views more  JUCS 2002»
13 years 9 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 9 months ago
CLP-based protein fragment assembly
Abstract. The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments ar...
Alessandro Dal Palù, Agostino Dovier, Feder...
ER
2010
Springer
121views Database» more  ER 2010»
13 years 8 months ago
Reasoning with Optional and Preferred Requirements
Abstract. Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work o...
Neil A. Ernst, John Mylopoulos, Alexander Borgida,...