Sciweavers

2233 search results - page 197 / 447
» On the Complexity of Theory Curbing
Sort
View
SASO
2010
IEEE
15 years 4 months ago
Designing Comprehensible Self-Organising Systems
Self-organising systems are a popular engineering concept for designing decentralised autonomic computing systems. They are able to find solutions in complex and versatile problem ...
Nicolas Höning, Han La Poutré
POPL
2009
ACM
16 years 7 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
16 years 14 days ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
AAAI
2006
15 years 8 months ago
Learning Systems of Concepts with an Infinite Relational Model
Relationships between concepts account for a large proportion of semantic knowledge. We present a nonparametric Bayesian model that discovers systems of related concepts. Given da...
Charles Kemp, Joshua B. Tenenbaum, Thomas L. Griff...
IJCAI
1993
15 years 7 months ago
Provably Bounded Optimal Agents
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
Stuart J. Russell, Devika Subramanian, Ronald Parr