Sciweavers

2543 search results - page 16 / 509
» Optimal Ordered Problem Solver
Sort
View
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
14 years 8 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
ICCSA
2003
Springer
14 years 28 days ago
Coarse-Grained Parallel Matrix-Free Solution of a Three-Dimensional Elliptic Prototype Problem
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
Kevin P. Allen, Matthias K. Gobbert
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 7 months ago
Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
Nuno P. Lopes, Levent Aksoy, Vasco M. Manquinho, J...
SAT
2004
Springer
115views Hardware» more  SAT 2004»
14 years 1 months ago
Full CNF Encoding: The Counting Constraints Case
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
Olivier Bailleux, Yacine Boufkhad
TACAS
2010
Springer
251views Algorithms» more  TACAS 2010»
14 years 25 days ago
Approximating the Pareto Front of Multi-criteria Optimization Problems
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
Julien Legriel, Colas Le Guernic, Scott Cotton, Od...