15792 search results - page 118 / 3159 » Computational Abstraction Steps |
236
Voted
NC
2011
14 years 6 months 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...
111
Voted
EUROPAR
2008
Springer
15 years 5 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...
148
Voted
FOCS
2007
IEEE
15 years 10 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...
138
Voted
ICLP
1995
Springer
15 years 7 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
125
Voted
ESOP
2001
Springer
15 years 8 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 ...