Sciweavers

1723 search results - page 157 / 345
» Cycling in linear programming problems
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
14 years 11 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
ICC
2009
IEEE
151views Communications» more  ICC 2009»
15 years 4 months ago
Slow Adaptive OFDMA via Stochastic Programming
—Fueled by the promises of high spectral efficiency, adaptive OFDMA has attracted enormous research interests over the last decade. The significant capacity gain of adaptive OF...
Wei Liang (William) Li, Ying Jun (Angela) Zhang, M...
ICML
2002
IEEE
15 years 10 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
PODC
2005
ACM
15 years 3 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
ANOR
2005
131views more  ANOR 2005»
14 years 10 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas