Sciweavers

1097 search results - page 212 / 220
» Boosting with incomplete information
Sort
View
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Assessing regret-based preference elicitation with the UTPREF recommendation system
Product recommendation and decision support systems must generally develop a model of user preferences by querying or otherwise interacting with a user. Recent approaches to elici...
Darius Braziunas, Craig Boutilier
84
Voted
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
PODC
1999
ACM
15 years 1 months ago
Optimal, Distributed Decision-Making: The Case of no Communication
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
Marios Mavronicolas, Paul G. Spirakis
HICSS
1999
IEEE
183views Biometrics» more  HICSS 1999»
15 years 1 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
ATAL
2006
Springer
15 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