3415 search results - page 412 / 683 » Lower bounds on kernelization |
171
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
179
click to vote
WAOA
2004
Springer
15 years 12 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
188
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
ACT We consider an optimal power and rate scheduling problem for a single user transmitting to a base station on a fading wireless link with the objective of minimizing the mean de...
179
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
171
click to vote
SI3D
2003
ACM
15 years 12 months ago
2003
ACM
Shadow mapping is a technique for doing real-time shadowing. Recent work has shown that shadow mapping hardware can be used as a second depth test in addition to the z-test. In th...