Sciweavers

550 search results - page 41 / 110
» Decision-Theoretic Simulated Annealing
Sort
View
IJCAI
2001
13 years 10 months ago
Reinforcement Learning in Distributed Domains: Beyond Team Games
Using a distributed algorithm rather than a centralized one can be extremely beneficial in large search problems. In addition, the incorporation of machine learning techniques lik...
David Wolpert, Joseph Sill, Kagan Tumer
INFORMATICALT
2006
150views more  INFORMATICALT 2006»
13 years 9 months ago
A Multiresolution Approach Based on MRF and Bak-Sneppen Models for Image Segmentation
The two major Markov Random Fields (MRF) based algorithms for image segmentation are the Simulated Annealing (SA) and Iterated Conditional Modes (ICM). In practice, compared to the...
Kamal E. Melkemi, Mohamed Batouche, Sebti Foufou
INFORMATICALT
2000
113views more  INFORMATICALT 2000»
13 years 9 months ago
An Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
Alfonsas Misevicius
WSC
2004
13 years 10 months ago
A New Method to Determine the Tool Count of a Semiconductor Factory Using FabSim
Tool count optimization is mandatory for an efficiently organized semiconductor factory. This paper describes an efficient heuristic to determine the tool count using the compact ...
Holger Vogt
GECCO
2005
Springer
118views Optimization» more  GECCO 2005»
14 years 2 months ago
Comparative evaluation of parallelization strategies for evolutionary and stochastic heuristics
In this paper we present an evaluation of selected parallel strategies for Simulated Annealing and Simulated Evolution, identifying the impact of various issues on the effectivene...
Sadiq M. Sait, Syed Sanaullah, Ali Mustafa Zaidi, ...