Sciweavers

14386 search results - page 240 / 2878
» The Chinese Generals Problem
Sort
View
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
14 years 11 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
CEC
2005
IEEE
15 years 10 months ago
An ant algorithm hyperheuristic for the project presentation scheduling problem
Abstract- Ant algorithms have generated significant research interest within the search/optimisation community in recent years. Hyperheuristic research is concerned with the devel...
Edmund K. Burke, Graham Kendall, Dario Landa Silva...
COLT
2005
Springer
15 years 10 months ago
Localized Upper and Lower Bounds for Some Estimation Problems
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...
Tong Zhang
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 10 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 10 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è...