2542 search results - page 16 / 509 » Computing Cartograms with Optimal Complexity |
TOG
2002
13 years 7 months ago
2002
We present a method for designing truss structures, a common and complex category of buildings, using non-linear optimization. Truss structures are ubiquitous in the industrialize...
COCO
1995
Springer
13 years 11 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
Let Fq be a finite field and consider an extension Fqn where an optimal normal element exists. Using the trace of an optimal normal element in Fqn , we provide low complexity norma...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...