Sciweavers

523 search results - page 21 / 105
» A Formal Account of WS-BPEL
Sort
View
POST
2012
218views more  POST 2012»
12 years 4 months ago
A Core Calculus for Provenance
Provenance is an increasing concern due to the revolution in sharing and processing scientific data on the Web and in other computer systems. It is proposed that many computer sys...
Umut A. Acar, Amal Ahmed, James Cheney, Roly Perer...
ICML
2003
IEEE
14 years 9 months ago
The Use of the Ambiguity Decomposition in Neural Network Ensemble Learning Methods
We analyze the formal grounding behind Negative Correlation (NC) Learning, an ensemble learning technique developed in the evolutionary computation literature. We show that by rem...
Gavin Brown, Jeremy L. Wyatt
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 9 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
ECSQARU
2009
Springer
14 years 3 months ago
Modelling Argument Accrual in Possibilistic Defeasible Logic Programming
Argumentation frameworks have proven to be a successful approach to formalizing commonsense reasoning. Recently, some argumentation frameworks have been extended to deal with possi...
Mauro Javier Gómez Lucero, Carlos Ivá...
FSTTCS
2007
Springer
14 years 2 months ago
Program Analysis Using Weighted Pushdown Systems
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
Thomas W. Reps, Akash Lal, Nicholas Kidd