Sciweavers

294 search results - page 57 / 59
» On Recursively Directed Hypercubes
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
BMCBI
2010
170views more  BMCBI 2010»
13 years 7 months ago
Analysis of lifestyle and metabolic predictors of visceral obesity with Bayesian Networks
Background: The aim of this study was to provide a framework for the analysis of visceral obesity and its determinants in women, where complex inter-relationships are observed amo...
Alex Aussem, André Tchernof, Sergio Rodrigu...
COMPUTING
2008
174views more  COMPUTING 2008»
13 years 7 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
Mario Bravetti
AML
2005
101views more  AML 2005»
13 years 7 months ago
Forcing and antifoundation
It is proved that the forcing apparatus can be built and set to work in ZFCA (=ZFC minus foundation plus the antifoundation axiom AFA). The key tools for this construction are gre...
Athanassios Tzouvaras