Sciweavers

176 search results - page 13 / 36
» heuristics 1998
Sort
View
SACRYPT
1998
Springer
129views Cryptology» more  SACRYPT 1998»
13 years 11 months ago
An Accurate Evaluation of Maurer's Universal Test
Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (...
Jean-Sébastien Coron, David Naccache
IJON
1998
87views more  IJON 1998»
13 years 7 months ago
Learned parametric mixture based ICA algorithm
The learned parametric mixture method is presented for a canonical cost function based ICA model on linear mixture, with several new findings. First, its adaptive algorithm is fu...
Lei Xu, Chi Chiu Cheung, Shun-ichi Amari
NC
2002
210views Neural Networks» more  NC 2002»
13 years 7 months ago
Recent approaches to global optimization problems through Particle Swarm Optimization
This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detectin...
Konstantinos E. Parsopoulos, Michael N. Vrahatis
COMCOM
1998
102views more  COMCOM 1998»
13 years 7 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
WSC
1998
13 years 9 months ago
An Analytical Comparison of Optimization Problem Generation Methodologies
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
Raymond R. Hill