Sciweavers

3433 search results - page 331 / 687
» Heuristics for a bidding problem
Sort
View
IRREGULAR
1995
Springer
15 years 10 months ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
15 years 10 months ago
Niching the CMA-ES via nearest-better clustering
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...
Mike Preuss
EUROS
2008
171views Robotics» more  EUROS 2008»
15 years 8 months ago
The Ares Robot: Case Study of an Affordable Service Robot
Abstract. Robustness is pivot for robots operating in all-terrain environments. This demand comes mainly due to the highly heterogeneous and unstructured nature of the terrain. Two...
Pedro Santana, Carlos Cândido, Paulo Santos,...
SDM
2008
SIAM
95views Data Mining» more  SDM 2008»
15 years 8 months ago
Deterministic Latent Variable Models and Their Pitfalls
We derive a number of well known deterministic latent variable models such as PCA, ICA, EPCA, NMF and PLSA as variational EM approximations with point posteriors. We show that the...
Max Welling, Chaitanya Chemudugunta, Nathan Sutter
NETWORKING
2004
15 years 8 months ago
A New Method of Primary Routes Selection for Local Restoration
We consider the problem of non-bifurcated multicommodity flows rerouting in survivable connection-oriented networks. We focus on local restoration, in which the backup route is rer...
Krzysztof Walkowiak