Sciweavers

138 search results - page 22 / 28
» Combinatorial Optimization Based Recommender Systems
Sort
View
ICML
1995
IEEE
14 years 8 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
QEST
2007
IEEE
14 years 1 months ago
Automated Analysis of Simulation Traces - Separating Progress from Repetitive Behavior
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
Peter Kemper, Carsten Tepper
CDC
2009
IEEE
158views Control Systems» more  CDC 2009»
13 years 11 months ago
Multiple target detection using Bayesian learning
In this paper, we study multiple target detection using Bayesian learning. The main aim of the paper is to present a computationally efficient way to compute the belief map update ...
Sujit Nair, Konda Reddy Chevva, Houman Owhadi, Jer...
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
14 years 27 days ago
A genetic algorithm for unmanned aerial vehicle routing
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
Matthew A. Russell, Gary B. Lamont
JAIR
2007
141views more  JAIR 2007»
13 years 7 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf