3415 search results - page 179 / 683 » Lower Bounds for Kernelizations |
157
click to vote
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
124
click to vote
EUC
2006
Springer
15 years 8 months ago
2006
Springer
We present the first Utility Accrual (or UA) real-time scheduling algorithm for multiprocessors, called gMUA. The algorithm considers an application model where real-time activiti...
152
click to vote
GD
2000
Springer
15 years 8 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
135
click to vote
DAM
1998
15 years 4 months ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
261
Voted
TON
2010
14 years 11 months ago
2010
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...