2834 search results - page 218 / 567 » Representing Trees with Constraints |
135
Voted
TIC
2000
Springer
15 years 4 months ago
2000
Springer
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
ISCAS
1995
IEEE
15 years 4 months ago
1995
IEEE
In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST)...
80
Voted
GRC
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper proposes a code granulation space which can be applied to program construction and processing. Each granule in the space is defined as an improvement to the seed progra...
97
Voted
AMAST
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
112
Voted
SBBD
2007
15 years 2 months ago
2007
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...