Sciweavers

2473 search results - page 120 / 495
» The Logic of Communication Graphs
Sort
View
141
Voted
ICCS
2010
Springer
15 years 2 months ago
Default Conceptual Graph Rules, Atomic Negation and Tic-Tac-Toe
Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show tha...
Jean-François Baget, Jérôme Fo...
137
Voted
DAC
2006
ACM
16 years 4 months ago
Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute i...
Sander Stuijk, Marc Geilen, Twan Basten
118
Voted
VISSYM
2007
15 years 6 months ago
Online Dynamic Graph Drawing
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, ...
Yaniv Frishman, Ayellet Tal
131
Voted
FMCAD
2004
Springer
15 years 7 months ago
A Functional Approach to the Formal Specification of Networks on Chip
We present a functional approach, based on the ACL2 logic, for the specification of system on a chip communication architectures. Our decomposition of the communications allows the...
Julien Schmaltz, Dominique Borrione
127
Voted
IJIT
2004
15 years 5 months ago
Rule-Based Message Passing for Collaborative Application in Distributed Environments
In this paper, we describe a rule-based message passing method to support developing collaborative applications, in which multiple users share resources in distributed environments...
Wataru Yamazaki, Hironori Hiraishi, Fumio Mizoguch...