Sciweavers

1221 search results - page 86 / 245
» A Comparison of Two Programming Models for Pervasive Computi...
Sort
View
ICTAI
1997
IEEE
15 years 6 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
IPPS
2010
IEEE
15 years 1 months ago
Performance evaluation of concurrent collections on high-performance multicore computing systems
This paper is the first extensive performance study of a recently proposed parallel programming model, called Concurrent Collections (CnC). In CnC, the programmer expresses her co...
Aparna Chandramowlishwaran, Kathleen Knobe, Richar...
86
Voted
ICSE
2009
IEEE-ACM
16 years 4 months ago
Reasoning about edits to feature models
Features express the variabilities and commonalities among programs in a software product line (SPL). A feature model defines the valid combinations of features, where each combin...
Christian Kästner, Don S. Batory, Thomas Th&u...
132
Voted
HYBRID
2010
Springer
15 years 9 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...
EUROPAR
1998
Springer
15 years 7 months ago
Performance Measurement of Interpreted Programs
Abstract. In an interpreted execution there is an interdependence between the interpreter's execution and the interpreted application's execution; the implementation of t...
Tia Newhall, Barton P. Miller