Sciweavers

5608 search results - page 174 / 1122
» On the Theory of Matchgate Computations
Sort
View
JAIR
2008
109views more  JAIR 2008»
15 years 1 months ago
Modular Reuse of Ontologies: Theory and Practice
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 1 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
76
Voted
INFSOF
2006
73views more  INFSOF 2006»
15 years 1 months ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley
103
Voted
MP
2006
107views more  MP 2006»
15 years 1 months ago
Convergence theory for nonconvex stochastic programming with an application to mixed logit
Monte Carlo methods have been used extensively in the area of stochastic programming. As with other methods that involve a level of uncertainty, theoretical properties are required...
Fabian Bastin, Cinzia Cirillo, Philippe L. Toint
135
Voted
ESORICS
2007
Springer
15 years 8 months ago
Adaptive Soundness of Static Equivalence
Abstract. We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equiva...
Steve Kremer, Laurent Mazaré