Sciweavers

14739 search results - page 250 / 2948
» An optimization problem on the sphere
Sort
View
HM
2007
Springer
107views Optimization» more  HM 2007»
15 years 5 months ago
A Memetic Algorithm for the Optimum Communication Spanning Tree Problem
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
Thomas Fischer, Peter Merz
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 4 months ago
Symbolic regression in multicollinearity problems
In this paper the potential of GP-generated symbolic regression for alleviating multicollinearity problems in multiple regression is presented with a case study in an industrial s...
Flor A. Castillo, Carlos M. Villa
WG
2005
Springer
15 years 4 months ago
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
15 years 4 months ago
Run Transferable Libraries - Learning Functional Bias in Problem Domains
Abstract. This paper introduces the notion of Run Transferable Libraries, a mechanism to pass knowledge acquired in one GP run to another. We demonstrate that a system using these ...
Maarten Keijzer, Conor Ryan, Mike Cattolico
COLT
2003
Springer
15 years 4 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis