16404 search results - page 759 / 3281 » A set coverage problem |
208
click to vote
ITA
2002
15 years 7 months ago
2002
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...
165
click to vote
ML
2002
ACM
15 years 7 months ago
2002
ACM
The decomposition method is currently one of the major methods for solving support vector machines. An important issue of this method is the selection of working sets. In this pape...
230
click to vote
WINE
2010
Springer
15 years 5 months ago
2010
Springer
der the issue of fair division of goods, using the cake cutting abstraction, and aim to bound the possible degradation in social welfare due to the fairness requirements. Previous...
209
click to vote
JUCS
2010
15 years 2 months ago
2010
: We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x 0. The oracle machines can also check whether...
186
click to vote
PODS
2002
ACM
16 years 7 months ago
2002
ACM
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...