Sciweavers

270 search results - page 29 / 54
» Optimizing Global-Local Search Hybrids
Sort
View
HM
2007
Springer
137views Optimization» more  HM 2007»
14 years 1 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
AIPS
2006
13 years 9 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith
EVOW
2007
Springer
14 years 1 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
ICIAP
2005
ACM
14 years 7 months ago
Scatter Search Particle Filter for 2D Real-Time Hands and Face Tracking
This paper presents the scatter search particle filter (SSPF) algorithm and its application to real-time hands and face tracking. SSPF combines sequential Monte Carlo (particle fil...
Antonio S. Montemayor, Juan José Pantrigo, ...
AAAI
2010
13 years 8 months ago
Bayesian Policy Search for Multi-Agent Role Discovery
Bayesian inference is an appealing approach for leveraging prior knowledge in reinforcement learning (RL). In this paper we describe an algorithm for discovering different classes...
Aaron Wilson, Alan Fern, Prasad Tadepalli