Sciweavers

14739 search results - page 368 / 2948
» An optimization problem on the sphere
Sort
View
ICML
1995
IEEE
16 years 7 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
16 years 4 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
EMO
2009
Springer
219views Optimization» more  EMO 2009»
16 years 1 months ago
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Hui Li, Dario Landa Silva
CBMS
2007
IEEE
16 years 1 months ago
Problem Solving Environment for Medical Image Analysis
The development of Medical Image Analysis (MIA) applications that can successfully be applied in clinical practice is difficult for several reasons, one of them being the large am...
Ketan C. Maheshwari, Sílvia Delgado Olabarr...
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
16 years 28 days ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs