2542 search results - page 83 / 509 » Computing Cartograms with Optimal Complexity |
142
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
142
Voted
ICICIC
2006
IEEE
15 years 8 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
112
Voted
ICTAI
2006
IEEE
15 years 8 months ago
2006
IEEE
A new method for optimizing complex functions and systems is described that employs Learnable Evolution Model (LEM), a form of non-Darwinian evolutionary computation guided by mac...
116
Voted
TIT
2010
14 years 9 months ago
2010
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...
122
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...