15485 search results - page 475 / 3097 » Computing Optimal Subsets |
201
click to vote
NCA
2003
IEEE
16 years 5 days ago
2003
IEEE
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...
156
click to vote
HPDC
1997
IEEE
15 years 11 months ago
1997
IEEE
Layering of protocols o ers several well-known advantages, but typically leads to performance ine ciencies. We present a model for layering, and point out where the performance pr...
204
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
191
click to vote
IJCSA
2007
15 years 6 months ago
2007
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
156
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...