2610 search results - page 329 / 522 » The Recognition Strategy Language |
166
click to vote
ICTAC
2004
Springer
15 years 12 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
205
click to vote
TOOLS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper reports on the utilisation of object technology in a university-level course on software development, specifically designed for distance learning, and now enrolling ove...
145
click to vote
SIGSOFT
2001
ACM
16 years 7 months ago
2001
ACM
Layered architecture in operating system code is often compromised by execution path-specific customizations such as prefetching, page replacement and scheduling strategies. Paths...
183
click to vote
IWOMP
2009
Springer
16 years 1 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
177
click to vote
AIIA
2007
Springer
16 years 20 days ago
2007
Springer
We present a simple, two-steps supervised strategy for the identification and classification of thematic roles in natural language texts. We employ no external source of informat...