Sciweavers

115 search results - page 19 / 23
» Bounds on the Number of Maximal Sum-Free Sets
Sort
View
ISTCS
1997
Springer
13 years 11 months ago
Exact Analysis of Exact Change
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
Pat Frankel
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
14 years 1 months ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet
GLOBECOM
2009
IEEE
13 years 11 months ago
Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS Constraints
An important performance measure in wireless networks is the manner in which the network can distributively manage its limited energy and spectrum resources, while assuring certain...
Stepán Kucera, Ludek Kucera, Bing Zhang
AAAI
2010
13 years 9 months ago
Coalitional Structure Generation in Skill Games
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet...
CORR
2008
Springer
83views Education» more  CORR 2008»
13 years 7 months ago
Resource Allocation in Multiple Access Channels
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...