Sciweavers

1089 search results - page 4 / 218
» Randomness and Reducibility
Sort
View
GECCO
2000
Springer
121views Optimization» more  GECCO 2000»
13 years 11 months ago
Informed operators: Speeding up genetic-algorithm-based design optimization using reduced models
In this paper we describe a method for improving genetic-algorithm-based optimization using informed genetic operators. The idea is to make the genetic operators such as mutation ...
Khaled Rasheed, Haym Hirsh
ICIP
1998
IEEE
14 years 9 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson
NOSSDAV
2004
Springer
14 years 1 months ago
Reduced state fair queuing for edge and core routers
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
Ramana Rao Kompella, George Varghese
LREC
2008
153views Education» more  LREC 2008»
13 years 9 months ago
Using Random Indexing to improve Singular Value Decomposition for Latent Semantic Analysis
We present results from using Random Indexing for Latent Semantic Analysis to handle Singular Value Decomposition tractability issues. We compare Latent Semantic Analysis, Random ...
Linus Sellberg, Arne Jönsson
IJCNN
2006
IEEE
14 years 1 months ago
Reducing Uncertainties in Neural Network Jacobians and Improving Accuracy of Neural Network Emulations with NN Ensemble Approach
—A new application of the NN ensemble technique to improve the accuracy and stability of the calculation of NN emulation Jacobians is presented. The term “emulation” is defin...
Vladimir M. Krasnopolsky