4767 search results - page 261 / 954 » Structures for Abstract Rewriting |
166
click to vote
ICFP
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
202
click to vote
KBSE
2000
IEEE
15 years 10 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
187
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
226
click to vote
BSDCON
2003
15 years 8 months ago
2003
The existing thread scheduler in FreeBSD was well suited towards the computing environment that it was developed in. As the priorities and hardware targets of the project have cha...
172
click to vote
OSDI
1996
ACM
15 years 7 months ago
1996
ACM
Current operating systems offer poor performance when a numeric application's working set does not fit in main memory. As a result, programmers who wish to solve "out-of...