Sciweavers

69 search results - page 9 / 14
» How robust are average complexity measures
Sort
View
ANSS
1996
IEEE
15 years 4 months ago
Computation of the Asymptotic Bias and Variance for Simulation of Markov Reward Models
The asymptotic bias and variance are important determinants of the quality of a simulation run. In particular, the asymptotic bias can be used to approximate the bias introduced b...
Aad P. A. van Moorsel, Latha A. Kant, William H. S...
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 4 months ago
A method for parameter calibration and relevance estimation in evolutionary algorithms
We present and evaluate a method for estimating the relevance and calibrating the values of parameters of an evolutionary algorithm. The method provides an information theoretic m...
Volker Nannen, A. E. Eiben
WSCG
2003
142views more  WSCG 2003»
15 years 1 months ago
Three-Dimensional Object Recognition: Statistical Approach
The design of a general purpose artificial vision system capable of recognizing arbitrarily complex threedimensional objects without human intervention is still a challenging task...
R. Abdul Salam, M. A. Rodrigues
100
Voted
ARVLSI
1999
IEEE
112views VLSI» more  ARVLSI 1999»
15 years 4 months ago
Architectural Considerations for Application-Specific Counterflow Pipelines
Application-specific processor design is a promising approach for meeting the performance and cost goals of a system. Application-specific processors are especially promising for ...
Bruce R. Childers, Jack W. Davidson
105
Voted
IEEEPACT
2009
IEEE
14 years 10 months ago
ITCA: Inter-task Conflict-Aware CPU Accounting for CMPs
Abstract--Chip-MultiProcessor (CMP) architectures are becoming more and more popular as an alternative to the traditional processors that only extract instruction-level parallelism...
Carlos Luque, Miquel Moretó, Francisco J. C...