375 search results - page 33 / 75 » Making Abstract Machines Less Abstract |
189
click to vote
EGICE
2006
15 years 10 months ago
2006
Abstract. In knowledge representation by fuzzy rule based systems two reasoning mechanisms can be distinguished: conjunction-based and implication-based inference. Both approaches ...
185
click to vote
LCPC
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. The technique of flattening nested data parallelism combines all the independent operations in nested apply-to-all constructs and generates large amounts of potential pa...
177
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Measuring relational similarity between words is important in numerous natural language processing tasks such as solving analogy questions and classifying noun-modifier r...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Space is a spatial programming language designed to exploit the massive parallelism available in a formal model of computation called the Synchronic A-Ram, and physically related ...
168
click to vote
LISP
2006
15 years 6 months ago
2006
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...