232 search results - page 37 / 47 » Termination of linear bounded term rewriting systems |
EMSOFT
2005
Springer
14 years 1 months ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
IWCMC
2009
ACM
14 years 2 months ago
2009
ACM
Multi-hop relaying will play a central role in next generation wireless systems. In this paper a novel relaying strategy that uses multiple-input multiple-output (MIMO) relays in ...
CASES
2010
ACM
13 years 5 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
SCP
2010
13 years 6 months ago
2010
Over the past two decades, Scheme macros have evolved into a powerful API for the compiler front-end. Like Lisp macros, their predecessors, Scheme macros expand source programs in...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...