Sciweavers

861 search results - page 19 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
CISIS
2010
IEEE
14 years 27 days ago
Study of Variations of Native Program Execution Times on Multi-Core Architectures
Abstract—Program performance optimisations, feedbackdirected iterative compilation and auto-tuning systems [1] all assume a fixed estimation of execution time given a fixed inp...
Abdelhafid Mazouz, Sid Ahmed Ali Touati, Denis Bar...
FDL
2004
IEEE
13 years 11 months ago
Error Estimation in Model-Driven Development for Real-Time Software
Model-driven approaches proved themselves not suited yet to support real-time software development. Even if they have the ability of capturing adequately both functional and non-f...
Oana Florescu, Jeroen Voeten, Jinfeng Huang, Henk ...
ICFP
2005
ACM
14 years 7 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 7 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
IJCAI
2003
13 years 9 months ago
Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
Tina Dell'Armi, Wolfgang Faber, Giuseppe Ielpa, Ni...