Sciweavers

1754 search results - page 295 / 351
» Games with Incomplete Information
Sort
View
HICSS
1999
IEEE
183views Biometrics» more  HICSS 1999»
14 years 2 months ago
Extending the Technology Acceptance Model to Account for Social Influence: Theoretical Bases and Empirical Validation
The Technology Acceptance Model (TAM) represents an important theoretical contribution toward understanding IS usage and IS acceptance behaviors [6, 19]. However, as noted by seve...
Yogesh Malhotra, Dennis F. Galletta
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
AI
2010
Springer
13 years 10 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...