6045 search results - page 140 / 1209 » Computable Linearizations of Well-partial-orderings |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider boolean circuits computing n-operators f : {0, 1}n {0, 1}n . As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operat...
DAC
1998
ACM
14 years 9 days ago
1998
ACM
This paper presents a general method for computing transient sensitivities using the adjoint method in event driven simulation algorithms that employ piecewise linear device model...
HIPC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
CDC
2009
IEEE
14 years 24 days ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
AAECC
2006
Springer
13 years 8 months ago
2006
Springer
We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularit...