113 search results - page 7 / 23 » On solving a hard quadratic 3-dimensional assignment problem |
RTCSA
2008
IEEE
15 years 5 months ago
2008
IEEE
This paper addresses the problem of using the Location IDentifier (LID) as the domain value of the index for trajectories of RFID tags and proposes the solution for solving this p...
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
GLOBECOM
2008
IEEE
15 years 5 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
GECCO
2008
Springer
15 years 4 days ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
PG
2007
IEEE
15 years 5 months ago
2007
IEEE
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...