Sciweavers

963 search results - page 165 / 193
» On Computation of Performance Bounds of Optimal Index Assign...
Sort
View
KES
2004
Springer
15 years 3 months ago
Extracting Stellar Population Parameters of Galaxies from Photometric Data Using Evolution Strategies and Locally Weighted Linea
There is now a huge amount of high quality photometric data available in the literature whose analysis is bound to play a fundamental role in studies of the formation and evolution...
Luis Alvarez, Olac Fuentes, Roberto Terlevich
85
Voted
CAP
2010
14 years 4 months ago
Accuracy versus time: a case study with summation algorithms
In this article, we focus on numerical algorithms for which, in practice, parallelism and accuracy do not cohabit well. In order to increase parallelism, expressions are reparsed,...
Philippe Langlois, Matthieu Martel, Laurent Th&eac...
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 3 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 9 months ago
One shot schemes for decentralized quickest change detection
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....
Olympia Hadjiliadis, Hongzhong Zhang, H. Vincent P...
68
Voted
CVPR
2008
IEEE
15 years 11 months ago
Graph cut with ordering constraints on labels and its applications
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu