Sciweavers

1097 search results - page 8 / 220
» Boosting with incomplete information
Sort
View
UAI
2004
14 years 11 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman
JCIT
2007
107views more  JCIT 2007»
14 years 9 months ago
A New Approach to Computing Weighted Attributes Values in Incomplete Information Systems
The Rough Sets theory has been conceived to deal with inexact, uncertain or vague knowledge in Information systems. The article is devoted to propose notions including the general...
Tian Hong, Wang Xiukun, Henryk Rybinski
80
Voted
SIGMOD
2003
ACM
115views Database» more  SIGMOD 2003»
15 years 9 months ago
Temporal Coalescing with Now, Granularity, and Incomplete Information
This paper presents a novel strategy for temporal coalescing. Temporal coalescing merges the temporal extents of value-equivalent tuples. A temporal extent is usually coalesced of...
Curtis E. Dyreson
GRC
2007
IEEE
15 years 3 months ago
MGRS in Incomplete Information Systems
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...
Yuhua Qian, Jiye Liang, Chuangyin Dang
ATAL
2004
Springer
15 years 3 months ago
Automated Multi-Attribute Negotiation with Efficient Use of Incomplete Preference Information
This paper presents a model for integrative, one-to-one negotiation in which the values across multiple attributes are negotiated simultaneously. We model a mechanism in which age...
Catholijn M. Jonker, Valentin Robu