Sciweavers

951 search results - page 190 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
AI
1999
Springer
13 years 5 months ago
Coalition Structure Generation with Worst Case Guarantees
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coal...
Tuomas Sandholm, Kate Larson, Martin Andersson, On...
MP
2002
143views more  MP 2002»
13 years 5 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
TIT
2002
98views more  TIT 2002»
13 years 5 months ago
DC-free binary convolutional coding
A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free and error correcting capability simultaneously. The scheme has a simple ca...
Tadashi Wadayama, A. J. Han Vinck
AMAI
2011
Springer
12 years 6 months ago
Multi-armed bandits with episode context
A multi-armed bandit episode consists of n trials, each allowing selection of one of K arms, resulting in payoff from a distribution over [0, 1] associated with that arm. We assum...
Christopher D. Rosin
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 6 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams