Sciweavers

257 search results - page 14 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
HEURISTICS
2010
14 years 7 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
AMAI
2006
Springer
14 years 9 months ago
Symmetric approximate linear programming for factored MDPs with application to constrained problems
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
Dmitri A. Dolgov, Edmund H. Durfee
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 1 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
GECCO
2003
Springer
15 years 2 months ago
Reinforcement Learning Estimation of Distribution Algorithm
Abstract. This paper proposes an algorithm for combinatorial optimizations that uses reinforcement learning and estimation of joint probability distribution of promising solutions ...
Topon Kumar Paul, Hitoshi Iba
NECO
2008
108views more  NECO 2008»
14 years 9 months ago
An SMO Algorithm for the Potential Support Vector Machine
We describe a fast Sequential Minimal Optimization (SMO) procedure for solving the dual optimization problem of the recently proposed Potential Support Vector Machine (P-SVM). The...
Tilman Knebel, Sepp Hochreiter, Klaus Obermayer