111 search results - page 11 / 23 » On the local performance of simulated annealing and the (1 1... |
COMSNETS
2012
12 years 3 months ago
2012
Abstract—Detecting and localizing performance faults is crucial for operating large enterprise data centers. This problem is relatively straightforward to solve if each entity (a...
KES
1999
Springer
14 years 2 hour ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
WSC
2004
13 years 9 months ago
2004
Increased complexity of simulation models and the related modeling needs for global supply chains have necessitated the execution of simulations on multiple processors. While dist...
BROADNETS
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, we present a novel fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backbone...