4767 search results - page 302 / 954 » Structures for Abstract Rewriting |
208
click to vote
WEA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
176
Voted
CONSTRAINTS
2010
15 years 4 months ago
2010
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
172
click to vote
ECAL
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Classical evolutionary algorithms have been extremely successful at solving certain problems. But they implement a very simple model of evolutionary biology that misses o...
178
click to vote
SEMWEB
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...
174
click to vote
PEPM
1994
ACM
15 years 10 months ago
1994
ACM
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...