Sciweavers

5608 search results - page 106 / 1122
» On the Theory of Matchgate Computations
Sort
View
STACS
2005
Springer
15 years 7 months ago
Dynamic Complexity Theory Revisited
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...
Volker Weber, Thomas Schwentick
CORR
2010
Springer
56views Education» more  CORR 2010»
15 years 1 months ago
Theory and Applications of Robust Optimization
In this paper we survey the primary research, both theoretical and applied, in the area of Robust Optimization (RO). Our focus is on the computational attractiveness of RO approac...
Dimitris Bertsimas, David B. Brown, Constantine Ca...
ENTCS
2007
89views more  ENTCS 2007»
15 years 1 months ago
Hierarchical Nominal Terms and Their Theory of Rewriting
Nominal rewriting introduced a novel method of specifying rewriting on syntax-with-binding. We extend this treatment of rewriting with hierarchy of variables representing increasi...
Murdoch Gabbay
CORR
1999
Springer
124views Education» more  CORR 1999»
15 years 1 months ago
An Algebraic Programming Style for Numerical Software and its Optimization
The abstract mathematical theory of partial differential equations (PDEs) is formulated in terms of manifolds,scalar fields, tensors, and the like, but these algebraic structures a...
T. B. Dinesh, Magne Haveraaen, Jan Heering
AI
2008
Springer
15 years 6 days ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey