Sciweavers

4940 search results - page 592 / 988
» On the Complexity of Universal Programs
Sort
View
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 12 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
ISPW
2010
IEEE
15 years 12 months ago
How to Welcome Software Process Improvement and Avoid Resistance to Change
Pressures for more complex products, customer dissatisfaction and problems related to cost and schedule overruns increase the need for effective management response and for improve...
Daniela Cristina Cascini Peixoto, Vitor A. Batista...
CF
2010
ACM
15 years 12 months ago
Enabling a highly-scalable global address space model for petascale computing
Over the past decade, the trajectory to the petascale has been built on increased complexity and scale of the underlying parallel architectures. Meanwhile, software developers hav...
Vinod Tipparaju, Edoardo Aprà, Weikuan Yu, ...
151
Voted
ECOOP
2010
Springer
15 years 11 months ago
Essential AOP: The A Calculus
Abstract. Aspect-oriented programming (AOP) has produced interesting language designs, but also ad hoc semantics that needs clarification. We contribute to this clarification wit...
Bruno De Fraine, Erik Ernst, Mario Südholt
174
Voted
ICSE
2010
IEEE-ACM
15 years 11 months ago
Developers ask reachability questions
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability q...
Thomas D. LaToza, Brad A. Myers