3471 search results - page 405 / 695 » Obstacle Numbers of Graphs |
168
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
In high level synthesis each node of a synchronous dataflow graph (DFG) is scheduled to a specific time and allocated to a processor. In this paper we present new integer linear p...
158
Voted
DAC
1993
ACM
15 years 10 months ago
1993
ACM
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...
158
click to vote
SC
1990
ACM
15 years 10 months ago
1990
ACM
Loop distribution is an integral part of transforming a sequential program into a parallel one. It is used extensively in parallelization,vectorization, and memory management. For...
193
click to vote
DEXA
2006
Springer
15 years 10 months ago
2006
Springer
Ontology alignment (or matching) is the operation that takes two ontologies and produces a set of semantic correspondences (usually semantic similarities) between some elements of ...
192
click to vote
ISLPED
1995
ACM
15 years 10 months ago
1995
ACM
ABSTRACT { Sub-micron technologies and the increasing size and complexity of integrated components have aggravated the e ect of long interconnects and buses, compared to that of ga...