10707 search results - page 308 / 2142 » Designing executable abstractions |
114
Voted
CEEMAS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract In this work we describe the development process of multiagent application design and implementation with Mulan. Our approach can be characterized as model driven developm...
135
Voted
DAC
1999
ACM
15 years 8 months ago
1999
ACM
This paper presents a design methodology, called common-case computation (CCC), and new design automation algorithms for optimizing power consumption or performance. The proposed ...
147
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Earlier work has developed the underpinnings of IC-Scheduling Theory, an algorithmic framework for scheduling computations having intertask dependencies for Internet-based computi...
140
click to vote
DEXA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
121
Voted
JLP
2011
14 years 7 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...