Sciweavers

5964 search results - page 342 / 1193
» A theory of speculative computation
Sort
View
202
Voted
IANDC
2006
97views more  IANDC 2006»
15 years 7 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner
CORR
1999
Springer
124views Education» more  CORR 1999»
15 years 7 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 months 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
335
Voted
ICGA
2006
312views Optimization» more  ICGA 2006»
17 years 7 months ago
New Approximate Strategies for Playing Sum Games based on Subgame Types
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
Manal Zaky, Cherif Salama, Salma Ghoneim
219
Voted
WG
2009
Springer
16 years 2 months ago
Chordal Digraphs
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
Daniel Meister, Jan Arne Telle