Sciweavers

429 search results - page 76 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
GECCO
2010
Springer
165views Optimization» more  GECCO 2010»
14 years 11 months ago
Evolving robust controller parameters using covariance matrix adaptation
In this paper, the advantages of introducing an additional amount of tests when evolving parameters for specific purposes is discussed. A set of optimal PID-controller parameters...
Gerulf K. M. Pedersen, Martin V. Butz
USITS
2001
14 years 11 months ago
Dynamic Host Configuration for Managing Mobility Between Public and Private Networks
The usage and service options of a pubic network generally differ from a private (enterprise or home) network and consequently, the two networks are often configured differently. ...
Allen K. L. Miu, Paramvir Bahl
KES
2006
Springer
14 years 9 months ago
The Repository Method for Chance Discovery in Financial Forecasting
Abstract. The aim of this work is to forecast future events in financial data sets, in particular, we focus our attention on situations where positive instances are rare, which fal...
Alma Lilia Garcia-Almanza, Edward P. K. Tsang
MP
2006
110views more  MP 2006»
14 years 9 months ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
Ted K. Ralphs, Matthew V. Galati
CVPR
2005
IEEE
15 years 11 months ago
Towards Complete Generic Camera Calibration
We consider the problem of calibrating a highly generic imaging model, that consists of a non-parametric association of a projection ray in 3D to every pixel in an image. Previous...
Srikumar Ramalingam, Peter F. Sturm, Suresh K. Lod...