AAAI
2010
13 years 11 months ago
2010
AAAI
2010
13 years 11 months ago
2010
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
AAAI
2010
13 years 11 months ago
2010
We consider here the problem of building a never-ending language learner; that is, an intelligent computer agent that runs forever and that each day must (1) extract, or read, inf...
AAAI
2010
13 years 11 months ago
2010
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
AAAI
2010
13 years 11 months ago
2010
On the surface, bidirectional search (BDS) is an attractive idea with the potential for significant asymptotic reductions in search effort. However, the results in practice often ...
AAAI
2010
13 years 11 months ago
2010
AAAI
2010
13 years 11 months ago
2010
We consider risk-sensitive generalizations of Nash and correlated equilibria in noncooperative games. We prove that, except for a class of degenerate games, unless a two-player ga...
AAAI
2010
13 years 11 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
AAAI
2010
13 years 11 months ago
2010
AAAI
2010
13 years 11 months ago
2010
Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of...