Sciweavers

1133 search results - page 129 / 227
» Basics of Graph Cuts
Sort
View
DAC
1996
ACM
15 years 2 months ago
Using Register-Transfer Paths in Code Generation for Heterogeneous Memory-Register Architectures
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
Guido Araujo, Sharad Malik, Mike Tien-Chien Lee
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
15 years 4 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng
GG
2004
Springer
15 years 3 months ago
Translating Java Code to Graph Transformation Systems
We propose a faithful encoding of Java programs (written in a suitable fragment of the language) to Graph Transformation Systems. Every program is translated to a set of rules incl...
Andrea Corradini, Fernando Luís Dotti, Luci...
ICES
2003
Springer
101views Hardware» more  ICES 2003»
15 years 3 months ago
A Developmental Method for Growing Graphs and Circuits
A review is given of approaches to growing neural networks and electronic circuits. A new method for growing graphs and circuits using a developmental process is discussed. The met...
Julian F. Miller, Peter Thomson
ASPDAC
1999
ACM
157views Hardware» more  ASPDAC 1999»
15 years 2 months ago
A Genetic Algorithm based Approach for Multi-Objective Data-Flow Graph Optimization
: This paper presents a genetic algorithm based approach for algebraic optimization of behavioral system specifications. We introduce a chromosomal representation of data-flow gr...
Birger Landwehr