2799 search results - page 249 / 560 » The regenerator location problem |
150
Voted
SRDS
2003
IEEE
15 years 12 months ago
2003
IEEE
In today’s systems, applications are composed from various components that may be located on different machines. The components (acting as servers) may have to collaborate in or...
139
click to vote
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
210
click to vote
SUTC
2010
IEEE
15 years 10 months ago
2010
IEEE
— Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However, due to the caching problem’s theoretical root ...
209
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
183
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...