Sciweavers

1712 search results - page 30 / 343
» A Computational Approach to Binding Theory
Sort
View
AGI
2008
15 years 1 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
PPDP
2004
Springer
15 years 5 months ago
Nominal rewriting systems
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
Maribel Fernández, Murdoch Gabbay, Ian Mack...
COMPSAC
2008
IEEE
15 years 6 months ago
Service-Oriented Modelling of Automotive Systems
We discuss the suitability of service-oriented computing for the automotive domain. We present a formal high-level language in which complex automotive activities can be modelled ...
Laura Bocchi, José Luiz Fiadeiro, Ant&oacut...
CSE
2009
IEEE
15 years 3 months ago
Satisficing the Masses: Applying Game Theory to Large-Scale, Democratic Decision Problems
ACT We present ongoing research on large-scale decision models in which there are many invested individuals. We apply our unique Bayesian belief aggregation approach to decision pr...
Kshanti A. Greene, Joe Michael Kniss, George F. Lu...
CIG
2005
IEEE
15 years 5 months ago
Similarity-based Opponent Modelling using Imperfect Domain Theories
Abstract- This paper proposes a similarity-based approach for opponent modelling in multi-agent games. The classification accuracy is increased by adding derived attributes from i...
Timo Steffens