Sciweavers

372 search results - page 45 / 75
» The box mover problem
Sort
View
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 10 months ago
Extraction of Symbolic Rules from Artificial Neural Networks
Although backpropagation ANNs generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions c...
S. M. Kamruzzaman, Md. Monirul Islam
MP
2010
163views more  MP 2010»
13 years 4 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
IPPS
2007
IEEE
14 years 4 months ago
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Hailiang Mei, Pravin Pawar, Ing Widya
IJCNN
2006
IEEE
14 years 3 months ago
Sparse Optimization for Second Order Kernel Methods
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
Roland Vollgraf, Klaus Obermayer
GECCO
2004
Springer
144views Optimization» more  GECCO 2004»
14 years 3 months ago
Feature Subset Selection, Class Separability, and Genetic Algorithms
Abstract. The performance of classification algorithms in machine learning is affected by the features used to describe the labeled examples presented to the inducers. Therefore,...
Erick Cantú-Paz