Sciweavers

17760 search results - page 235 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
CP
2008
Springer
15 years 6 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
IJCAI
2001
15 years 6 months ago
Genetic Algorithm based Selective Neural Network Ensemble
Neural network ensemble is a learning paradigm where several neural networks are jointly used to solve a problem. In this paper, the relationship between the generalization abilit...
Zhi-Hua Zhou, Jianxin Wu, Yuan Jiang, Shifu Chen
CEC
2010
IEEE
15 years 5 months ago
A modified genetic algorithm for matching building sets with the histograms of forces
Abstract--This paper presents an approach to the task of locating a group of buildings based solely on their relative spatial relationships. This situation can occur in the problem...
Andrew R. Buck, James M. Keller, Marjorie Skubic
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 4 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
JANCL
2008
170views more  JANCL 2008»
15 years 4 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko