Sciweavers

4940 search results - page 589 / 988
» On the Complexity of Universal Programs
Sort
View
IPPS
2007
IEEE
16 years 1 months ago
The Next Generation Software Workshop - IPDPS'07
This workshop provides a forum for an overview, project presentations, and discussion of the research fostered and funded initially by the NSF Next Generation Software (NGS) Progr...
Frederica Darema
RTSS
2007
IEEE
16 years 1 months ago
Adapting Futures: Scalability for Real-World Computing
Creating robust real-time embedded software is critical in combining the physical world with computing, such as in consumer electronics or robotics. One challenge is the complexit...
Johannes Helander, Risto Serg, Margus Veanes, Prit...
ATAL
2007
Springer
16 years 29 days ago
ARTS: agent-oriented robust transactional system
This paper presents the ARTS (Agent-oriented Robust Transactional System) model, which applies transaction concepts to provide agent developers with high-level support for agent s...
Mingzhong Wang, Amy Unruh, Kotagiri Ramamohanarao
CC
2007
Springer
16 years 28 days ago
Correcting the Dynamic Call Graph Using Control-Flow Constraints
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
Byeongcheol Lee, Kevin Resnick, Michael D. Bond, K...
EUROPAR
2007
Springer
16 years 28 days ago
Fine Tuning Algorithmic Skeletons
Abstract. Algorithmic skeletons correspond to a high-level programming model that takes advantage of nestable programming patterns to hide the complexity of parallel/distributed ap...
Denis Caromel, Mario Leyton