Sciweavers

4940 search results - page 422 / 988
» On the Complexity of Universal Programs
Sort
View
WCRE
2007
IEEE
16 years 1 months ago
A Model to Understand the Building and Running Inter-Dependencies of Software
The notion of functional or modular dependency is fundamental to understand the architecture and inner workings of any software system. In this paper, we propose to extend that no...
Daniel M. Germán, Jesús M. Gonz&aacu...
ISLPED
2005
ACM
101views Hardware» more  ISLPED 2005»
16 years 12 days ago
Energy-aware fetch mechanism: trace cache and BTB customization
1 A highly-efficient fetch unit is essential not only to obtain good performance but also to achieve energy efficiency. However, existing designs are inflexible and depending on pr...
Daniel Chaver, Miguel A. Rojas, Luis Piñuel...
ECML
2005
Springer
16 years 11 days ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
ATVA
2004
Springer
135views Hardware» more  ATVA 2004»
16 years 7 days ago
Using Block-Local Atomicity to Detect Stale-Value Concurrency Errors
Data races do not cover all kinds of concurrency errors. This paper presents a data-ow-based technique to nd stale-value errors, which are not found by low-level and high-level d...
Cyrille Artho, Klaus Havelund, Armin Biere
CD
2004
Springer
16 years 7 days ago
Asynchronous, Hierarchical, and Scalable Deployment of Component-Based Applications
The deployment of distributed component-based applications is a complex task. Proposed solutions are often centralized, which excludes their use for the deployment of large-scale a...
Vivien Quéma, Roland Balter, Luc Bellissard...