Sciweavers

8080 search results - page 90 / 1616
» Distributed Constrained Optimization
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 10 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
IOR
2008
89views more  IOR 2008»
13 years 9 months ago
Impulse Control of Brownian Motion: The Constrained Average Cost Case
When a manufacturer places repeated orders with a supplier to meet changing production requirements, he faces the challenge of finding the right balance between holding costs and ...
Melda Ormeci, J. G. Dai, John H. Vande Vate
NN
2006
Springer
13 years 9 months ago
Missing data imputation through GTM as a mixture of t-distributions
The Generative Topographic Mapping (GTM) was originally conceived as a probabilistic alternative to the well-known, neural networkinspired, Self-Organizing Maps. The GTM can also ...
Alfredo Vellido
GECCO
2004
Springer
14 years 2 months ago
Controlled Content Crossover: A New Crossover Scheme and Its Application to Optical Network Component Allocation Problem
In this paper, a new genetic mating scheme called Controlled Content Crossover (CCC) is proposed and applied to solve the optical network component allocation problem. In order to ...
Mohammad Amin Dallaali, Malin Premaratne
GECCO
2003
Springer
111views Optimization» more  GECCO 2003»
14 years 2 months ago
An Adaptive Penalty Scheme for Steady-State Genetic Algorithms
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is a...
Helio J. C. Barbosa, Afonso C. C. Lemonge