Sciweavers

76 search results - page 1 / 16
» An improved stochastic local search method in a multistart f...
Sort
View
AMC
2008
88views more  AMC 2008»
14 years 10 months ago
Stopping rules for box-constrained stochastic global optimization
We present three new stopping rules for Multistart based methods. The first uses a device that enables the determination of the coverage of the bounded search domain. The second i...
Isaac E. Lagaris, Ioannis G. Tsoulos
EOR
2010
116views more  EOR 2010»
14 years 10 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
SOCO
2010
Springer
14 years 8 months ago
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
Local genetic algorithms have been designed with the aim of providing effective intensification. One of their most outstanding features is that they may help classical local searc...
Carlos García-Martínez, Manuel Lozan...
WSC
2004
14 years 11 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
ALMOB
2006
155views more  ALMOB 2006»
14 years 10 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...