Sciweavers

2354 search results - page 380 / 471
» Randomness, Stochasticity and Approximations
Sort
View
SIMPRA
2008
99views more  SIMPRA 2008»
15 years 5 months ago
Response surface methodology for constrained simulation optimization: An overview
This article summarizes `Generalized Response Surface Methodology'(GRSM), extending Box and Wilson's `Response Surface Methodology'(RSM). GRSM allows multiple rando...
Jack P. C. Kleijnen
140
Voted
NPL
2000
95views more  NPL 2000»
15 years 5 months ago
Bayesian Sampling and Ensemble Learning in Generative Topographic Mapping
Generative topographic mapping (GTM) is a statistical model to extract a hidden smooth manifold from data, like the self-organizing map (SOM). Although a deterministic search algo...
Akio Utsugi
HEURISTICS
2002
65views more  HEURISTICS 2002»
15 years 5 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...
VTC
2010
IEEE
140views Communications» more  VTC 2010»
15 years 4 months ago
Analysis of Local Quasi-Stationarity Regions in an Urban Macrocell Scenario
—A common simplification in the treatment of random linear channels is the wide-sense stationary and uncorrelated scattering (WSSUS) assumption. For wireless channels, this assu...
Adrian Ispas, Gerd Ascheid, Christian Schneider, R...
ANTSW
2010
Springer
15 years 3 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...