Sciweavers

962 search results - page 13 / 193
» Near-optimal solutions for the generalized max-controlled se...
Sort
View
EOR
2006
118views more  EOR 2006»
14 years 9 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
ATMOS
2007
152views Optimization» more  ATMOS 2007»
14 years 11 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth
IJIG
2008
222views more  IJIG 2008»
14 years 9 months ago
An Analytical Solution to the Perspective-n-Point Problem for Common Planar Camera and for Catadioptric Sensor
The Perspective-N-Point problem (PNP) is a notable problem in computer vision. It consists in, given N points known in an object coordinate space and their projection onto the ima...
Jonathan Fabrizio, Jean Devars
IDA
2009
Springer
15 years 4 months ago
Bayesian Solutions to the Label Switching Problem
Abstract. The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC ...
Kai Puolamäki, Samuel Kaski
CEC
2009
IEEE
15 years 4 months ago
A clustering particle swarm optimizer for dynamic optimization
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
Changhe Li, Shengxiang Yang