143 search results - page 20 / 29 » Fixed-Parameter Complexity of Semantics for Logic Programs |
183
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
SPE
2002
14 years 9 months ago
2002
This study presents a practical solution for data collection and restoration to migrate a process written in high level stack-based languages such as C and Fortran over a network ...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
VRML
2003
ACM
15 years 2 months ago
2003
ACM
Embodied agents or humanoid avatars may effectively be used to communicate with human users. Currently there is a wide range of specification formalisms and scripting languages f...
STOC
2001
ACM
15 years 9 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...