8695 search results - page 151 / 1739 » Making the Complex Simple |
93
Voted
FPCA
1989
15 years 4 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
91
Voted
CAL
2008
15 years 28 days ago
2008
This article proposes a novel parallel, hardware-oriented deadlock detection algorithm for multiprocessor system-on-chips. The proposed algorithm takes full advantage of hardware ...
92
Voted
ENDM
2010
15 years 27 days ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
JACM
2000
15 years 18 days ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
121
Voted
PE
2008
Springer
15 years 23 days ago
2008
Springer
Ratings (also known as recommendations) provide an efficient and effective way to build trust relationship in the human society, by making use of the information from others rathe...