Sciweavers

478 search results - page 4 / 96
» Improving probability bounds by optimization over subsets
Sort
View
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 5 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
SAT
2007
Springer
118views Hardware» more  SAT 2007»
14 years 1 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 7 months ago
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
Igal Sason, Idan Goldenberg
ICPR
2010
IEEE
13 years 7 months ago
The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround
Abstract—We point out a problem inherent in the optimization scheme of many popular feature selection methods. It follows from the implicit assumption that higher feature selecti...
Petr Somol, Jiri Grim, Pavel Pudil
GECCO
2007
Springer
156views Optimization» more  GECCO 2007»
14 years 1 months ago
Hierarchical genetic programming based on test input subsets
Crucial to the more widespread use of evolutionary computation techniques is the ability to scale up to handle complex problems. In the field of genetic programming, a number of d...
David Jackson