787 search results - page 150 / 158 » Polynomial Constants are Decidable |
113
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
173
click to vote
ALGOSENSORS
2009
Springer
15 years 10 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
169
click to vote
ALGOSENSORS
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
163
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
177
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...