Sciweavers

1299 search results - page 72 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
IJCNN
2007
IEEE
15 years 4 months ago
On Extending the SMO Algorithm Sub-Problem
—The Support Vector Machine is a widely employed machine learning model due to its repeatedly demonstrated superior generalization performance. The Sequential Minimal Optimizatio...
Christopher Sentelle, Michael Georgiopoulos, Georg...
AAAI
2006
14 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
ICNC
2009
Springer
15 years 4 months ago
Reducing Boarding Time: Synthesis of Improved Genetic Algorithms
—With the aim to minimize boarding time and devise procedures for boarding strategies, this paper develop the synthesis of Improved Genetic Algorithms and simulation. This paper ...
Kang Wang
ICPR
2006
IEEE
15 years 11 months ago
Approximation of Digital Curves using a Multi-Objective Genetic Algorithm
In this paper, a digital planar curve approximation method based on a multi-objective genetic algorithm is proposed. In this method, the optimization/exploration algorithm locates...
Hervé Locteau, Romain Raveaux, Sébas...
STACS
2010
Springer
15 years 4 months ago
Treewidth Reduction for Constrained Separation and Bipartization Problems
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
Dániel Marx, Barry O'Sullivan, Igor Razgon