Sciweavers

1133 search results - page 107 / 227
» Basics of Graph Cuts
Sort
View
ECEASST
2010
14 years 7 months ago
Assemblies as Graph Processes
This short paper explores the potential of embedding-based graph rewriting as a tool for understanding natural computing, and in particular self-assembly. The basic point of view i...
Dirk Janssens
PARLE
1987
15 years 1 months ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
ASP
2003
Springer
15 years 3 months ago
Graphs and colorings for answer set programming: Abridged Report
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
Kathrin Konczak, Torsten Schaub, Thomas Linke
WWW
2003
ACM
15 years 10 months ago
Data-Sharing Relationships in the Web
We propose a novel structure, the data-sharing graph, for characterizing sharing patterns in large-scale data distribution systems. We analyze this structure in two such systems a...
Adriana Iamnitchi, Matei Ripeanu, Ian T. Foster
ISCAPDCS
2007
14 years 11 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel