13841 search results - page 302 / 2769 » Algorithms and Constraint Programming |
205
click to vote
DATESO
2009
15 years 4 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
156
click to vote
KBSE
2010
IEEE
15 years 5 months ago
2010
IEEE
During code review tasks, comparing two versions of a hardware design description using existing program differencing tools such as diff is inherently limited because existing p...
166
click to vote
GG
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
174
click to vote
ASPLOS
1998
ACM
15 years 11 months ago
1998
ACM
Several application and technology trends indicate that it might be both pro table and feasible to move computation closer to the data that it processes. In this paper, we evaluat...
168
click to vote
CIBCB
2005
IEEE
16 years 10 days ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...