Sciweavers

232 search results - page 40 / 47
» Termination of linear bounded term rewriting systems
Sort
View
CODES
2006
IEEE
15 years 8 months ago
Efficient computation of buffer capacities for multi-rate real-time systems with back-pressure
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...
Maarten Wiggers, Marco Bekooij, Pierre G. Jansen, ...
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
16 years 5 days ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
CAV
2004
Springer
152views Hardware» more  CAV 2004»
15 years 11 months ago
Abstract Regular Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...
LACL
2005
Springer
15 years 11 months ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis
TIT
2008
73views more  TIT 2008»
15 years 6 months ago
L-CAMP: Extremely Local High-Performance Wavelet Representations in High Spatial Dimension
A new wavelet-based methodology for representing data on regular grids is introduced and studied. The main attraction of this new L-CAMP methodology is in the way it scales with th...
Youngmi Hur, Amos Ron