Sciweavers

2520 search results - page 345 / 504
» The complexity of approximating entropy
Sort
View
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
15 years 8 months ago
Coevolution of neural networks using a layered pareto archive
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
German A. Monroy, Kenneth O. Stanley, Risto Miikku...
RT
2000
Springer
15 years 8 months ago
Walkthroughs with Corrective Texturing
Abstract. We present a new hybrid rendering method for interactive walkthroughs in photometrically complex environments. The display process starts from some approximation of the s...
Marc Stamminger, Jörg Haber, Hartmut Schirmac...
ICTAI
1997
IEEE
15 years 8 months ago
GA-Based Performance Analysis of Network Protocols
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Gi...
ICCV
1995
IEEE
15 years 8 months ago
Alignment by Maximization of Mutual Information
A new information-theoretic approach is presented for finding the pose of an object in an image. The technique does not require information about the surface properties of the ob...
Paul A. Viola, William M. Wells III
APCCAS
2006
IEEE
261views Hardware» more  APCCAS 2006»
15 years 6 months ago
A Grouped Fast Fourier Transform Algorithm Design For Selective Transformed Outputs
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
Chih-Peng Fan, Guo-An Su