Sciweavers

565 search results - page 29 / 113
» A Guided Monte Carlo Approach to Optimization Problems
Sort
View
FS
2006
84views more  FS 2006»
14 years 10 months ago
Iterative construction of the optimal Bermudan stopping time
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...
Anastasia Kolodko, John Schoenmakers
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
15 years 3 months ago
Memory-based immigrants for genetic algorithms in dynamic environments
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent year...
Shengxiang Yang
CEC
2008
IEEE
15 years 4 months ago
Auto-tuning fuzzy granulation for evolutionary optimization
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
Mohsen Davarynejad, Mohammad R. Akbarzadeh-Totonch...
CEC
2007
IEEE
15 years 1 months ago
An ant system with steps counter for the job shop scheduling problem
In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showe...
Emanuel Tellez-Emiquez, Efrén Mezura-Montes...
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 10 days ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang