657 search results - page 87 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
75
Voted
WADS
1995
Springer
15 years 3 months ago
1995
Springer
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...
DCG
2010
14 years 12 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
138
click to vote
FUN
2010
Springer
15 years 3 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
WCNC
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...