4432 search results - page 81 / 887 » Solving Demodulation as an Optimization Problem |
110
Voted
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...
114
Voted
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
112
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The coalition structure formation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involve...
118
click to vote
TEC
2008
15 years 2 months ago
2008
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
149
click to vote
IICAI
2003
15 years 3 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...