1274 search results - page 28 / 255 » N-fold integer programming |
GD
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
HM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A Video-on-Demand system usually consists of a large number of independent video servers. In order to utilize network resources as efficiently as possible the overall net...
TVCG
2011
13 years 4 months ago
2011
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
DAC
2006
ACM
14 years 10 months ago
2006
ACM
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
