Sciweavers

851 search results - page 117 / 171
» Random constructions and density results
Sort
View
SIMUTOOLS
2008
14 years 11 months ago
Snapshot simulation of internet traffic: fast and accurate for heavy-tailed flows
Simulations involving processes at very different time scales can be so slow to converge that starting in one state and waiting for a representative sample of the state space to b...
R. G. Addie
FLAIRS
2004
14 years 11 months ago
ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
Ying Feng, Robert L. Goldstone, Vladimir Menkov
WSC
2004
14 years 11 months ago
Quasi-Monte Carlo Methods in Finance
We review the basic principles of Quasi-Monte Carlo (QMC) methods, the randomizations that turn them into variancereduction techniques, and the main classes of constructions under...
Pierre L'Ecuyer
AAAI
2000
14 years 11 months ago
Gridworlds as Testbeds for Planning with Incomplete Information
Gridworlds are popular testbeds for planning with incomplete information but not much is known about their properties. We study a fundamental planning problem, localization, to in...
Craig A. Tovey, Sven Koenig
DAM
2006
89views more  DAM 2006»
14 years 10 months ago
First vs. best improvement: An empirical study
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first impr...
Pierre Hansen, Nenad Mladenovic