Sciweavers

1477 search results - page 80 / 296
» Complexity of (iterated) dominance
Sort
View
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 7 months ago
Coordinate change operators for genetic algorithms
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...
ICIP
2004
IEEE
16 years 7 months ago
Simplified digital holographic reconstruction using statistical methods
For reconstructing a complex object wavefront from digital holograms, we propose a new penalized-likelihood approach based on the measurement statistics and edge-preserving regula...
Jeffrey A. Fessler, Saowapak Sotthivirat
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
15 years 10 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
GLOBECOM
2009
IEEE
16 years 1 months ago
Linear Beamforming for Multiuser MIMO Downlink Systems with Channel Orthogonalization
— Recently linear processing strategies have been developed to approach the optimum performance of dirty paper coding with low complexity in multiuser multiple-input multipleoutp...
Jin-Sung Kim, Sung Hyun Moon, Inkyu Lee
VLSID
2005
IEEE
167views VLSI» more  VLSID 2005»
16 years 6 months ago
A Methodology and Tooling Enabling Application Specific Processor Design
This paper presents a highly efficient processor design methodology based on the LISA 2.0 language. Typically the architecture design phase is dominated by an iterative processor ...
Andreas Hoffmann, Frank Fiedler, Achim Nohl, Suren...