1002 search results - page 160 / 201 » Towards Graph Programs for Graph Algorithms |
131
click to vote
ASPDAC
2001
ACM
15 years 5 months ago
2001
ACM
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
111
click to vote
CASCON
2003
15 years 3 months ago
2003
The development of large software systems involves a continual lengthy build process that may include preprocessing, compilation and linking of tens of thousands of source code ï¬...
143
click to vote
CCCG
2003
15 years 3 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
COLING
1992
15 years 3 months ago
1992
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make li...
122
click to vote
JCP
2006
15 years 1 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...