Sciweavers

14774 search results - page 62 / 2955
» Computational complexity and evolutionary computation
Sort
View
120
Voted
TCOM
2011
108views more  TCOM 2011»
14 years 10 months ago
Computational Complexity of Decoding Orthogonal Space-Time Block Codes
— The computational complexity of optimum decoding for an orthogonal space-time block code is quantified. Four equivalent techniques of optimum decoding which have the same comp...
Ender Ayanoglu, Erik G. Larsson, Eleftherios Karip...
153
Voted
VIS
2008
IEEE
134views Visualization» more  VIS 2008»
16 years 5 months ago
A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for lar...
Attila Gyulassy, Peer-Timo Bremer, Bernd Hamann,...
114
Voted
CGI
1998
IEEE
15 years 8 months ago
Memory Management Schemes for Radiosity Computation in Complex Environments
Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not f...
Daniel Meneveaux, Kadi Bouatouch, Eric Maisel
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 7 months ago
Inside a predator-prey model for multi-objective optimization: a second study
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
Christian Grimme, Karlheinz Schmitt
144
Voted
RTA
2010
Springer
15 years 7 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser