Sciweavers

1399 search results - page 21 / 280
» Multi-party Finite Computations
Sort
View
CONCUR
2004
Springer
14 years 1 months ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
CG
2008
Springer
13 years 12 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003
COMPUTING
2002
93views more  COMPUTING 2002»
13 years 9 months ago
Non-Nested Multi-Level Solvers for Finite Element Discretisations of Mixed Problems
We consider a general framework for analysing the convergence of multi-grid solvers applied to finite element discretisations of mixed problems, both of conforming and nonconformi...
V. John, P. Knobloch, Gunar Matthies, Lutz Tobiska
COMPUTING
2006
76views more  COMPUTING 2006»
13 years 10 months ago
Hypergeometric Summation Algorithms for High-order Finite Elements
A. Becirovic, Peter Paule, Veronika Pillwein, Axel...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 10 months ago
Correlated Equilibria in Continuous Games: Characterization and Computation
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
Noah D. Stein, Pablo A. Parrilo, Asuman E. Ozdagla...