Sciweavers

3250 search results - page 238 / 650
» An Algorithm to Solve a Linear Program
Sort
View
CORR
2006
Springer
130views Education» more  CORR 2006»
15 years 6 months ago
Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
Christian Gagné, Marc Schoenauer, Mich&egra...
ICASSP
2009
IEEE
15 years 10 months ago
Detection of sparse signals under finite-alphabet constraints
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
Zhi Tian, Geert Leus, Vincenzo Lottici
AIIA
2007
Springer
16 years 22 days ago
A Top Down Interpreter for LPAD and CP-Logic
Logic Programs with Annotated Disjunctions and CP-logic are two different but related languages for expressing probabilistic information in logic programming. The paper presents a...
Fabrizio Riguzzi
EUROGP
2003
Springer
101views Optimization» more  EUROGP 2003»
15 years 11 months ago
An Enhanced Framework for Microprocessor Test-Program Generation
Test programs are fragment of code, but, unlike ordinary application programs, they are not intended to solve a problem, nor to calculate a function. Instead, they are supposed to ...
Fulvio Corno, Giovanni Squillero
ESOP
2008
Springer
15 years 8 months ago
Iterative Specialisation of Horn Clauses
Abstract. We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decid...
Christoffer Rosenkilde Nielsen, Flemming Nielson, ...