2542 search results - page 17 / 509 » Computing Cartograms with Optimal Complexity |
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
WSC
2008
13 years 10 months ago
2008
The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
SMA
2005
ACM
14 years 1 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...