2313 search results - page 90 / 463 » On Heuristic Time Hierarchies |
167
click to vote
ISORC
2005
IEEE
15 years 12 months ago
2005
IEEE
Heuristic algorithms have enjoyed increasing interests and success in the context of Utility Accrual (UA) scheduling. However, few analytical results, such as bounds on task-level...
165
click to vote
ICIP
1994
IEEE
16 years 7 months ago
1994
IEEE
It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In ...
183
click to vote
ISSTA
2009
ACM
16 years 27 days ago
2009
ACM
Code coverage is a common aid in the testing process. It is generally used for marking the source code segments that were executed and, more importantly, those that were not execu...
155
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
172
click to vote
LFCS
1997
Springer
15 years 10 months ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...