Sciweavers

1171 search results - page 10 / 235
» Variable neighborhood search
Sort
View
AAAI
2012
11 years 9 months ago
A Search Algorithm for Latent Variable Models with Unbounded Domains
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
Michael Chiang, David Poole
SLS
2007
Springer
120views Algorithms» more  SLS 2007»
14 years 1 months ago
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to ...
Benoît Laurent, Jin-Kao Hao
IEICET
2010
96views more  IEICET 2010»
13 years 5 months ago
An Unsupervised Optimization of Structuring Elements for Noise Removal Using GA
—To recover texture images from impulse noise by the opening operation which is one of morphological operations, an suitable structuring element (SE) has to be estimated. Hithert...
Hiroyuki Okuno, Yoshiko Hanada, Mitsuji Muneyasu, ...
EVOW
2006
Springer
13 years 11 months ago
The Core Concept for the Multidimensional Knapsack Problem
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
Jakob Puchinger, Günther R. Raidl, Ulrich Pfe...