66 search results - page 8 / 14 » Worst Cases of a Periodic Function for Large Arguments |
IJCAI
1997
13 years 9 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
PAKM
2000
13 years 9 months ago
2000
The core of the new product development [NPD] process centers on knowledge creation, utilization and the management of knowledge. This manuscript uses a software firm case to esta...
GLOBECOM
2008
IEEE
13 years 7 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
CODES
2007
IEEE
13 years 11 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...
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...