Sciweavers

2911 search results - page 251 / 583
» A Logic of Graph Constraints
Sort
View
HYBRID
2009
Springer
16 years 1 months ago
Distributed Tree Rearrangements for Reachability and Robust Connectivity
This paper studies connectivity maintenance in robotic networks. We propose a distributed coordination algorithm that can be combined with the individual motion control strategies ...
Michael Schuresko, Jorge Cortés
CORR
2006
Springer
116views Education» more  CORR 2006»
15 years 6 months ago
Memory Aware High-Level Synthesis for Embedded Systems
We introduce a new approach to take into account the memory architecture and the memory mapping in the High- Level Synthesis of Real-Time embedded systems. We formalize the memory...
Gwenolé Corre, Eric Senn, Nathalie Julien, ...
CSL
2008
Springer
15 years 8 months ago
On Counting Generalized Colorings
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
Tomer Kotek, Johann A. Makowsky, Boris Zilber
SEMWEB
2001
Springer
15 years 11 months ago
Utilizing Host-Formalisms to Extend RDF-Semantics
Abstract. RDF may be considered as an application of XML intended to interoperably exchange semantics between Web applications. In its current form, this objective may be hard to r...
Wolfram Conen, Reinhold Klapsing
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
15 years 11 months ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...