Sciweavers

14739 search results - page 23 / 2948
» An optimization problem on the sphere
Sort
View
COR
2010
146views more  COR 2010»
13 years 7 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
WWW
2004
ACM
14 years 8 months ago
A smart hill-climbing algorithm for application server configuration
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...
Bowei Xi, Zhen Liu, Mukund Raghavachari, Cathy H. ...
GECCO
2010
Springer
222views Optimization» more  GECCO 2010»
13 years 6 months ago
Black-box optimization benchmarking of NEWUOA compared to BIPOP-CMA-ES: on the BBOB noiseless testbed
In this paper, the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) on some noiseless functions are compared to those of the BI-POPulation Covariance Matrix A...
Nikolaus Hansen, Raymond Ros
VTC
2006
IEEE
104views Communications» more  VTC 2006»
14 years 1 months ago
Low-Complexity Optimal Detection for Hybrid Space-Time Block Coding and Spatial Multiplexing
— The combination of space-time block codes (STBC) and spatial multiplexing (SM) schemes has the advantages of diversity gain and high data rate. For such STBC/SM hybrid systems,...
Yue Wu, Chintha Tellambura
CORR
2002
Springer
109views Education» more  CORR 2002»
13 years 7 months ago
Sufficiently Fat Polyhedra are not 2-castable
In this note we consider the problem of manufacturing a convex polyhedral object via casting. We consider a generalization of the sand casting process where the object is manufact...
David Bremner, Alexander Golynski