15792 search results - page 118 / 3159 » Computational Abstraction Steps |
NC
2011
13 years 4 days ago
2011
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be ap...
EUROPAR
2008
Springer
13 years 11 months ago
2008
Springer
nomic Management Abstractions M. Aldinucci1 , M. Danelutto1 , and P. Kilpatrick2 1 Dept. Computer Science, Univ. of Pisa, Italy 2 Dept. Computer Science, Queen's Univ. of Belf...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
ICLP
1995
Springer
14 years 25 days ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
ESOP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...