Sciweavers

1959 search results - page 13 / 392
» Concerned About Separation
Sort
View
IPL
2002
125views more  IPL 2002»
13 years 9 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
AOSD
2007
ACM
14 years 1 months ago
A direction for research on virtual machine support for concern composition
This position paper suggests research directions in the area of virtual machines supporting aspect-oriented capabilities in the context of object-oriented languages. Categories an...
Harold Ossher
ER
2000
Springer
136views Database» more  ER 2000»
14 years 1 months ago
Business Modelling Is Not Process Modelling
Innovative e-business projects start with a design of the e-business model. We often encounter the view, in research as well as industry practice, that an e-business model is simil...
Jaap Gordijn, Hans Akkermans, Hans van Vliet
MODELS
2010
Springer
13 years 8 months ago
Concern-Based (de)composition of Model-Driven Software Development Processes
An MDSD process is often organised as transformation chain. This can threaten the Separation of Concerns (SoC) principle, because information is replicated in, scattered over, and ...
Jendrik Johannes, Uwe Aßmann
ICSE
1999
IEEE-ACM
14 years 2 months ago
An Initial Assessment of Aspect-Oriented Programming
The principle of separation of concerns has long been used by software engineers to manage the complexity of software system development. Programming languages help software engin...
Robert J. Walker, Elisa L. A. Baniassad, Gail C. M...