Sciweavers

1763 search results - page 268 / 353
» A Formalization of Polytime Functions
Sort
View
SEMWEB
2009
Springer
15 years 4 months ago
Axiomatic First-Order Probability
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
Kathryn B. Laskey
ACMSE
2009
ACM
15 years 4 months ago
Ginger: implementing a new Lisp family syntax
In this paper we introduce G-expressions, a new syntax based on the S-expression syntax utilized by most Lisp family languages. We have implemented a new homoiconic language, Ging...
James Dean Palmer
FOAL
2009
ACM
15 years 4 months ago
A machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement some unit of program functionality. In most product lines, only some combination of fe...
Benjamin Delaware, William R. Cook, Don S. Batory
ECRTS
2008
IEEE
15 years 4 months ago
Period and Deadline Selection for Schedulability in Real-Time Systems
Task period adaptations are often used to alleviate temporal overload conditions in real-time systems. Existing frameworks assume that only task periods are adjustable and that ta...
Thidapat Chantem, Xiaofeng Wang, Michael D. Lemmon...
EDOC
2008
IEEE
15 years 4 months ago
Managing the Life Cycle of Access Rules in CEOSIS
The definition and management of access rules (e.g., to control the access to business documents and business functions) is an important task within any enterprise information sy...
Stefanie Rinderle-Ma, Manfred Reichert