2542 search results - page 127 / 509 » Computing Cartograms with Optimal Complexity |
126
Voted
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
This work focuses on the development of a parallel framework method to improve the effectiveness and the efficiency of the obtained solutions by Multi-objective Evolutionary Algori...
127
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
152
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
153
Voted
DAC
1997
ACM
15 years 7 months ago
1997
ACM
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...
144
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...