Sciweavers

804 search results - page 75 / 161
» On the Termination of the Chase Algorithm
Sort
View
75
Voted
FLOPS
2006
Springer
15 years 4 months ago
Resource Analysis by Sup-interpretation
We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...
Jean-Yves Marion, Romain Péchoux
81
Voted
ENTCS
2006
174views more  ENTCS 2006»
15 years 17 days ago
Context Sequence Matching for XML
Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-...
Temur Kutsia
86
Voted
FUIN
2006
78views more  FUIN 2006»
15 years 17 days ago
Resource-Constrained Workflow Nets
We study concurrent processes modelled as workflow Petri nets extended with resource constraints. We define a behavioural correctness criterion called soundness: given a sufficient...
Kees M. van Hee, Natalia Sidorova, Marc Voorhoeve
JNW
2006
74views more  JNW 2006»
15 years 15 days ago
Mobility Resistant Clustering in Multi-Hop Wireless Networks
This paper presents a Distributed Efficient Clustering Approach (DECA) for mobility-resistant and energy-efficient clustering in multi-hop wireless networks. The clusterheads cover...
Miao Yu, Jason H. Li, Renato Levy
FPGA
2003
ACM
117views FPGA» more  FPGA 2003»
15 years 5 months ago
PipeRoute: a pipelining-aware router for FPGAs
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
Akshay Sharma, Carl Ebeling, Scott Hauck