Sciweavers

11160 search results - page 363 / 2232
» Incompleteness in a General Setting
Sort
View
201
Voted
ATAL
2006
Springer
15 years 10 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
ERCIMDL
2006
Springer
234views Education» more  ERCIMDL 2006»
15 years 10 months ago
Intelligent Bibliography Creation and Markup for Authors: A Step Towards Interoperable Digital Libraries
The move towards integrated international Digital Libraries offers the opportunity of creating comprehensive data on citation networks. These data are not only invaluable pointers ...
Bettina Berendt, Kai Dingel, Christoph Hanser
SDB
1995
178views Database» more  SDB 1995»
15 years 10 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
CCS
2008
ACM
15 years 8 months ago
Ether: malware analysis via hardware virtualization extensions
Malware has become the centerpiece of most security threats on the Internet. Malware analysis is an essential technology that extracts the runtime behavior of malware, and supplie...
Artem Dinaburg, Paul Royal, Monirul I. Sharif, Wen...
ATAL
2010
Springer
15 years 8 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...