840 search results - page 24 / 168 » Inapproximability of Combinatorial Optimization Problems |
IRREGULAR
1995
Springer
14 years 2 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
MICCAI
2007
Springer
14 years 12 months ago
2007
Springer
Abstract. An important issue in electroencephalographiy (EEG) experiments is to measure accurately the three dimensional (3D) positions of the electrodes. We propose a system where...
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
IAT
2007
IEEE
14 years 5 months ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
TEC
2002
13 years 10 months ago
2002
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principl...