694 search results - page 113 / 139 » Open Graphs and Computational Reasoning |
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
PODC
2010
ACM
14 years 28 days ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
INTERNET
2007
13 years 9 months ago
2007
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
CCGRID
2010
IEEE
13 years 6 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
WCRE
2006
IEEE
14 years 3 months ago
2006
IEEE
The understanding of the structure of a software system can be improved by analyzing the system’s evolution during development. Visualizations of software history that provide o...