Sciweavers

3381 search results - page 111 / 677
» LEO - DB2's LEarning Optimizer
Sort
View
IJCNN
2006
IEEE
14 years 4 months ago
A Columnar Competitive Model with Simulated Annealing for Solving Combinatorial Optimization Problems
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
Eu Jin Teoh, Huajin Tang, Kay Chen Tan
ALT
2010
Springer
13 years 11 months ago
Optimal Online Prediction in Adversarial Environments
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
Peter L. Bartlett
PR
2010
163views more  PR 2010»
13 years 8 months ago
Optimal feature selection for support vector machines
Selecting relevant features for Support Vector Machine (SVM) classifiers is important for a variety of reasons such as generalization performance, computational efficiency, and ...
Minh Hoai Nguyen, Fernando De la Torre
SEAL
2010
Springer
13 years 8 months ago
Dominance-Based Pareto-Surrogate for Multi-Objective Optimization
Abstract. Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Paret...
Ilya Loshchilov, Marc Schoenauer, Michèle S...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
14 years 1 months ago
On-line evolutionary computation for reinforcement learning in stochastic domains
In reinforcement learning, an agent interacting with its environment strives to learn a policy that specifies, for each state it may encounter, what action to take. Evolutionary c...
Shimon Whiteson, Peter Stone