2714 search results - page 265 / 543 » Approximation Schemes for Scheduling |
139
click to vote
GCC
2005
Springer
15 years 10 months ago
2005
Springer
Grid computing technologies enable large-scale aggregation and sharing of resources via wide-area networks focused on sharing computational, data, and other resources to form gener...
125
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
136
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
123
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we study the problem of dynamic optimization of ping schedule in an active sonar buoy network deployed to provide persistent surveillance of a littoral area throu...
138
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...