6598 search results - page 286 / 1320 » Graph Theory with Applications |
167
click to vote
DATE
2005
IEEE
16 years 7 days ago
2005
IEEE
This paper presents an exploration approach for the researcher to choose the suitable size of Scratch-Pad memory (SPM) for maximal performance improvement of a specified applicat...
174
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
167
click to vote
FPL
2007
Springer
15 years 8 months ago
2007
Springer
Reconfiguration time in dynamically-reconfigurable modular systems can severely limit application run-time compared to the critical path delay. In this paper we present a novel ...
183
click to vote
ISSS
2000
IEEE
15 years 10 months ago
2000
IEEE
In data dominated applications, like multi-media and telecom applications, data storage and transfers are the most important factors in terms of energy consumption, area and syste...
175
click to vote
AGTIVE
1999
Springer
15 years 11 months ago
1999
Springer
A suitable software architecture –for example in the area of distributed application– can be composed of known-to-work solutions. These are also known as design patterns. Howev...