4767 search results - page 178 / 954 » Structures for Abstract Rewriting |
139
Voted
FCCM
1997
IEEE
15 years 6 months ago
1997
IEEE
The RAW benchmark suite consists of twelve programs designed to facilitate comparing, validating, and improving reconfigurable computing systems. These benchmarks run the gamut o...
155
Voted
IPPS
2010
IEEE
15 years 16 days ago
2010
IEEE
Abstract--The now commonplace multi-core chips have introduced, by design, a deep hierarchy of memory and cache banks within parallel computers as a tradeoff between the user frien...
113
click to vote
TLCA
2009
Springer
15 years 9 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
120
Voted
CONCUR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is l...
114
Voted
SEMWEB
2007
Springer
15 years 8 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...