Sciweavers

5331 search results - page 146 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 3 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
ICDAR
2003
IEEE
15 years 3 months ago
Binary Classification Trees for Multi-class Classification Problems
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
Jin-Seon Lee, Il-Seok Oh
IOR
2011
152views more  IOR 2011»
14 years 5 months ago
Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition
We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as ...
Naomi Miller, Andrzej Ruszczynski
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
14 years 11 months ago
A hybrid method for tuning neural network for time series forecasting
This paper presents an study about a new Hybrid method GRASPES - for time series prediction, inspired in F. Takens theorem and based on a multi-start metaheuristic for combinatori...
Aranildo Rodrigues Lima Junior, Tiago Alessandro E...
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 10 months ago
On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stab...
Ankan Saha, Ambuj Tewari