Sciweavers

4403 search results - page 803 / 881
» Galois Theory of Algorithms
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 4 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
ECCC
2010
122views more  ECCC 2010»
15 years 4 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
15 years 4 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
JACM
2010
137views more  JACM 2010»
15 years 4 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
PPDP
2010
Springer
15 years 4 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann