265 search results - page 4 / 53 » Neighborhood Composition: A Parallelization of Local Search ... |
FGCS
2007
13 years 7 months ago
2007
Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorith...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...
IJAR
2010
13 years 5 months ago
2010
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...