2713 search results - page 280 / 543 » Parameterized Tree Systems |
155
Voted
EURODAC
1994
IEEE
15 years 10 months ago
1994
IEEE
Clock routing has become a critical issue in the layout design of high-performance systems. We show that the two passes bottom-up and top-down of the DME algorithm 2, 3, 4, 8 can ...
190
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
A new method for the analysis of 3D medical images is introduced. The algorithm is based on Biological Models of ants known as Artificial Life models. Test images (lung Computed To...
181
click to vote
AMAST
2008
Springer
15 years 8 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...
160
click to vote
AAAI
2010
15 years 8 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
140
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...