179 search results - page 23 / 36 » Polynomial Time Approximation Schemes for Geometric k-Cluste... |
DIALM
2003
ACM
14 years 1 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
JUCS
2010
13 years 6 months ago
2010
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
ICALP
2001
Springer
14 years 10 days ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
DAC
2009
ACM
14 years 8 months ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...