Sciweavers

5889 search results - page 1019 / 1178
» Graph Layout Problems
Sort
View
WINE
2010
Springer
178views Economy» more  WINE 2010»
15 years 5 days ago
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
Patrick Briest, Parinya Chalermsook, Sanjeev Khann...
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
15 years 5 days ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
ECRTS
2009
IEEE
15 years 3 days ago
Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
Raimund Kirner, Albrecht Kadlec, Peter P. Puschner
ICCV
2009
IEEE
15 years 2 days ago
Image annotation using multi-label correlated Green's function
Image annotation has been an active research topic in the recent years due to its potentially large impact on both image understanding and web/database image search. In this paper...
Hua Wang, Heng Huang, Chris H. Q. Ding
CLEIEJ
2010
14 years 11 months ago
3D-Via Driven Partitioning for 3D VLSI Integrated Circuits
A 3D circuit is the stacking of regular 2D circuits. The advances on the fabrication and packaging technologies allowed interconnecting stacked 2D circuits by using 3D vias. Howeve...
Sandro Sawicki, Gustavo Wilke, Marcelo O. Johann, ...
« Prev « First page 1019 / 1178 Last » Next »