62 search results - page 5 / 13 » A Hybrid of Inference and Local Search for Distributed Combi... |
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that simultaneously performs multi...
PPSN
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
IJACTAICIT
2010
13 years 2 months ago
2010
In this paper, a recurrent neural network based fuzzy inference system (RNFIS) for prediction is proposed. A recurrent network is embedded in the RNFIS by adding feedback connecti...
PVM
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....