Sciweavers

590 search results - page 107 / 118
» Resolution-stationary random number generators
Sort
View
ATAL
2008
Springer
15 years 1 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis
IASTEDSE
2004
15 years 1 months ago
A deterministic density algorithm for pairwise interaction coverage
Pairwise coverage of factors affecting software has been proposed to screen for potential errors. Techniques to generate test suites for pairwise coverage are evaluated according ...
Charles J. Colbourn, Myra B. Cohen, Renée T...
WSC
2001
15 years 1 months ago
Study of an ergodicity pitfall in multitrajectory simulation
Multitrajectory Simulation allows random events in a simulation to generate multiple trajectories. Management techniques have been developed to manage the choices of trajectories ...
John B. Gilmer Jr., Frederick J. Sullivan
ICCVW
1999
Springer
15 years 4 months ago
A General Method for Feature Matching and Model Extraction
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
Clark F. Olson
SPAA
1994
ACM
15 years 3 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher