1237 search results - page 63 / 248 » Abstract shade trees |
125
click to vote
CSCLP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
154
click to vote
FSTTCS
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
115
click to vote
MFCS
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We consider the iterates of bilinear functions over the semiring (max, +). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (...
129
click to vote
TCBB
2008
15 years 4 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
131
click to vote
TCAD
2002
15 years 4 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...