Sciweavers

1928 search results - page 359 / 386
» XML with incomplete information
Sort
View
ATAL
2006
Springer
14 years 1 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
AAAI
2007
14 years 6 days ago
Minimal Mental Models
Agents must form and update mental models about each other in a wide range of domains: team coordination, plan recognition, social simulation, user modeling, games of incomplete i...
David V. Pynadath, Stacy Marsella
CATS
2006
13 years 11 months ago
On the Logical Implication of Multivalued Dependencies with Null Values
The implication of multivalued dependencies (MVDs) in relational databases has originally been defined in the context of some fixed finite universe (Fagin 1977, Zaniolo 1976). Whi...
Sebastian Link
MCU
2004
126views Hardware» more  MCU 2004»
13 years 11 months ago
Universality and Cellular Automata
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
Klaus Sutner
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 11 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand