334 search results - page 6 / 67 » Computability of simple games: A characterization and applic... |
LCN
2005
IEEE
14 years 2 months ago
2005
IEEE
A formal approach for characterizing, evaluating and modeling packet reordering is presented. Reordering is, a phenomenon that is likely to become increasingly common on Internet,...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided amon...
MASCOTS
2004
13 years 10 months ago
2004
A simple, tunable, synthetic benchmark with a performance directly related to applications would be of great benefit to the scientific computing community. In this paper, we prese...