157 search results - page 4 / 32 » Optimal meta search results clustering |
COMPSAC
2004
IEEE
15 years 3 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
Recent developments in networking technology cause a growing interest in connecting local-area clusters of workstations over wide-area links, creating multilevel clusters, or meta...
JSAC
2007
14 years 11 months ago
2007
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
83
Voted
IDA
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
112
Voted
WSC
2004
15 years 1 months ago
2004
Simulation and Emulation techniques are fundamental to aid the process of large-scale protocol design and network operations. However, the results from these techniques are often ...