Sciweavers

8109 search results - page 37 / 1622
» A Model of Component-Based Programming
Sort
View
JAIR
2012
211views Hardware» more  JAIR 2012»
12 years 1 months ago
Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
Joohyung Lee, Ravi Palla
JMLR
2012
12 years 1 months ago
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu
BIRTHDAY
2010
Springer
14 years 3 months ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
ICSE
2010
IEEE-ACM
14 years 3 months ago
Legacy component integration by the Fujaba real-time tool suite
We present a Tool Suite which supports the (re-)construction of a behavioral model of a legacy component based on a learning approach by exploiting knowledge of known models of th...
Stefan Henkler, Jan Meyer, Wilhelm Schäfer, M...
TSE
1998
102views more  TSE 1998»
13 years 10 months ago
Designing Masking Fault-Tolerance via Nonmasking Fault-Tolerance
—Masking fault-tolerance guarantees that programs continually satisfy their specification in the presence of faults. By way of contrast, nonmasking fault-tolerance does not guara...
Anish Arora, Sandeep S. Kulkarni