Sciweavers

2877 search results - page 387 / 576
» The Complexity of Planarity Testing
Sort
View
CEC
2007
IEEE
15 years 10 months ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
CISS
2007
IEEE
15 years 10 months ago
On Capacity of Automatic Target Recognition Systems Under the Constraint of PCA-Encoding
Limiting capabilities of practical recognition systems are determined by a variety of factors that include source encoding techniques, quality of images, complexity of underlying ...
Xiaohan Chen, Natalia A. Schmid
DATE
2007
IEEE
160views Hardware» more  DATE 2007»
15 years 10 months ago
FPGA-based networking systems for high data-rate and reliable in-vehicle communications
The amount of electronic systems introduced in vehicles is continuously increasing: X-by-wire, complex electronic control systems and above all future applications such as automot...
Sergio Saponara, Esa Petri, Marco Tonarelli, Iacop...
DATE
2007
IEEE
102views Hardware» more  DATE 2007»
15 years 10 months ago
Efficient testbench code synthesis for a hardware emulator system
: - The rising complexity of modern embedded systems is causing a significant increase in the verification effort required by hardware designers and software developers, leading to...
Ioannis Mavroidis, Ioannis Papaefstathiou
DATE
2007
IEEE
150views Hardware» more  DATE 2007»
15 years 10 months ago
Fast memory footprint estimation based on maximal dependency vector calculation
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
Qubo Hu, Arnout Vandecappelle, Per Gunnar Kjeldsbe...