Sciweavers

2900 search results - page 137 / 580
» On the Convergence of Immune Algorithms
Sort
View
IAT
2006
IEEE
16 years 14 days ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler
COLT
2004
Springer
15 years 11 months ago
Boosting Based on a Smooth Margin
Abstract. We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly designed to produce maximum margins. To deri...
Cynthia Rudin, Robert E. Schapire, Ingrid Daubechi...
JMLR
2010
115views more  JMLR 2010»
15 years 4 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
IOR
2011
133views more  IOR 2011»
15 years 1 months ago
Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
Binyuan Chen, Simge Küçükyavuz, S...
DAGM
2008
Springer
15 years 8 months ago
Simple Incremental One-Class Support Vector Classification
We introduce the OneClassMaxMinOver (OMMO) algorithm for the problem of one-class support vector classification. The algorithm is extremely simple and therefore a convenient choice...
Kai Labusch, Fabian Timm, Thomas Martinetz