2019 search results - page 204 / 404 » Programming with Shared Data Abstractions |
165
click to vote
ACMMSP
2006
ACM
15 years 7 months ago
2006
ACM
We introduce a method for providing lightweight daemons, called simplifiers, that attach themselves to program data. If a data item has a simplifier, the simplifier may be run aut...
123
Voted
EDBT
2000
ACM
15 years 7 months ago
2000
ACM
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
112
click to vote
HICSS
2006
IEEE
15 years 9 months ago
2006
IEEE
The focus of this study is to explore why public agencies implement enterprise architecture programs and the interoperability challenges they are faced with when governing these p...
125
Voted
IFL
1997
Springer
15 years 7 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
118
Voted
EMSOFT
2006
Springer
15 years 7 months ago
2006
Springer
Synchronous data-flow languages such as Scade/Lustre manage infinite sequences, or streams, as primitive values making them naturally adapted to the description of datadominated s...