3146 search results - page 320 / 630 » Efficient Consequence Finding |
145
click to vote
ICSE
1997
IEEE-ACM
15 years 8 months ago
1997
IEEE-ACM
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
124
Voted
ICPP
1993
IEEE
15 years 8 months ago
1993
IEEE
- The subcube allocation problem in faulty hypercubes is studied in this paper. An efficient method for forming the set of regular subcubes is proposed. A concept of irregular subc...
140
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
159
click to vote
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
Clock skew scheduling is a technique that intentionally introduces skews to memory elements to improve the performance of a sequential circuit. It was shown in [21] that the full ...
144
click to vote
AUTONOMICS
2007
ACM
15 years 8 months ago
2007
ACM
A good understanding of contact patterns in delay tolerant networks (DTNs) is essential for the design of effective routing schemes. Prior work has typically focused on intercontac...