20 search results - page 2 / 4 » Annotation-Directed Run-Time Specialization in C |
ACMSE
2010
ACM
13 years 3 months ago
2010
ACM
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
EMSOFT
2005
Springer
13 years 11 months ago
2005
Springer
Run-time communication management in a Network-on-Chip (NoC) is a challenging task. On one hand, the NoC needs to satisfy the communication requirements (e.g. throughput) of runni...
DAC
2008
ACM
14 years 6 months ago
2008
ACM
We are presenting a new concept of an application-specific processor that is capable of transmuting its instruction set according to non-predictive application behavior during run...
COCOA
2008
Springer
13 years 7 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
SIAMCOMP
2008
13 years 5 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...