4114 search results - page 172 / 823 » Efficient Algorithms for the 2-Center Problems |
184
click to vote
CSI
2006
15 years 6 months ago
2006
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...
175
click to vote
GRID
2006
Springer
15 years 6 months ago
2006
Springer
This paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ign...
162
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
193
click to vote
EMMCVPR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
287
click to vote
ICDE
2002
IEEE
16 years 7 months ago
2002
IEEE
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...