2681 search results - page 234 / 537 » Problem F |
126
click to vote
SIGECOM
2010
ACM
15 years 5 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
100
Voted
ICPR
2002
IEEE
16 years 1 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
101
Voted
ICNP
2009
IEEE
15 years 7 months ago
2009
IEEE
—In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermitten...
95
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
86
Voted
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...