Sciweavers

301 search results - page 22 / 61
» Using PCM in Next-generation Embedded Space Applications
Sort
View
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
14 years 1 months ago
Improving EA-based design space exploration by utilizing symbolic feasibility tests
This paper will propose a novel approach in combining Evolutionary Algorithms with symbolic techniques in order to improve the convergence of the algorithm in the presence of larg...
Thomas Schlichter, Christian Haubelt, Jürgen ...
CVPR
2010
IEEE
14 years 4 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
EMSOFT
2003
Springer
14 years 27 days ago
Constraint-Based Design-Space Exploration and Model Synthesis
An important bottleneck in model-based design of embedded systems is the cost of constructing models. This cost can be significantly decreased by increasing the reuse of existing m...
Sandeep Neema, Janos Sztipanovits, Gabor Karsai, K...
CODES
2006
IEEE
14 years 1 months ago
The pipeline decomposition tree: : an analysis tool for multiprocessor implementation of image processing applications
Modern embedded systems for image processing involve increasingly complex levels of functionality under real-time and resourcerelated constraints. As this complexity increases, th...
Dong-Ik Ko, Shuvra S. Bhattacharyya
CASES
2005
ACM
13 years 9 months ago
Exploring the design space of LUT-based transparent accelerators
Instruction set customization accelerates the performance of applications by compressing the length of critical dependence paths and reducing the demands on processor resources. W...
Sami Yehia, Nathan Clark, Scott A. Mahlke, Kriszti...