2473 search results - page 185 / 495 » The Logic of Communication Graphs |
122
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
We describe a formal model for annotating linguistic artifacts, from which we derive an application programming interface (API) to a tools for manipulating these annotations. The ...
158
click to vote
KR
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
232
click to vote
ISCA
2002
IEEE
15 years 3 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
132
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
140
click to vote
CHARME
2001
Springer
15 years 7 months ago
2001
Springer
The framework of this paper is the formal specification and proof of applications distributed on symmetric interconnection networks, e.g. the torus or the hypercube. The algorithms...