Sciweavers

960 search results - page 47 / 192
» Optimal Monte Carlo Algorithms
Sort
View
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
13 years 9 months ago
New challenges for memetic algorithms on continuous multi-objective problems
Adriana Lara, Oliver Schütze, Carlos A. Coell...
CCE
2004
13 years 7 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
WEA
2007
Springer
114views Algorithms» more  WEA 2007»
14 years 1 months ago
Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data
Abstract. A major task in evolutionary biology is to determine the ancestral relationships among the known species, a process generally referred as phylogenetic reconstruction. In ...
Fei Ye, Yan Guo, Andrew Lawson, Jijun Tang
JAIR
2007
111views more  JAIR 2007»
13 years 7 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson
NAA
2000
Springer
125views Mathematics» more  NAA 2000»
13 years 11 months ago
Matrix Computations Using Quasirandom Sequences
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
Michael Mascagni, Aneta Karaivanova