83 search results - page 9 / 17 » Bounding Loop Iterations for Timing Analysis |
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
AAAI
2010
15 years 1 months ago
2010
In a previous paper, Liu argued for the importance of establishing a precise theoretical foundation for program debugging from first principles. In this paper, we present a first ...
CODES
2007
IEEE
15 years 3 months ago
2007
IEEE
For the worst-case execution time (WCET) analysis, especially loops are an inherent source of unpredictability and loss of precision. This is caused by the difficulty to obtain sa...
ISPD
2003
ACM
15 years 5 months ago
2003
ACM
Delay evaluation is always a crucial concern in the VLSI design and it becomes increasingly more critical in the nowadays deep-submicron technology. To obtain an accurate delay va...
109
Voted
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
Parallelizing compiler technology has improved in recent years. One area in which compilers have made progress is in handling DOACROSS loops, where crossprocessor data dependencie...