6045 search results - page 896 / 1209 » Computable Linearizations of Well-partial-orderings |
169
click to vote
DAC
2005
ACM
15 years 8 months ago
2005
ACM
Variability of process parameters makes prediction of digital circuit timing characteristics an important and challenging problem in modern chip design. Recently, statistical stat...
178
click to vote
STRINGOLOGY
2008
15 years 8 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
287
click to vote
WAE
2001
15 years 8 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
166
click to vote
ATVA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
190
click to vote
CAD
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...