18306 search results - page 393 / 3662 » Algorithmics in Exponential Time |
232
Voted
SCHEDULING
2008
15 years 7 months ago
2008
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
206
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
197
click to vote
INFOCOM
2000
IEEE
15 years 12 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
173
click to vote
ISSAC
2005
Springer
16 years 28 days ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
225
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Consider a generic data unit of random size L that needs to be transmitted over a channel of unit capacity. The channel dynamics is modeled as an on-off process {(Ai, Ui)}i≥1...