Sciweavers

6740 search results - page 50 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
110
Voted
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
15 years 8 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
111
Voted
CSDA
2007
115views more  CSDA 2007»
15 years 3 months ago
Algorithms for compact letter displays: Comparison and evaluation
Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multi...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
MP
2008
129views more  MP 2008»
15 years 3 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
TCOM
2010
109views more  TCOM 2010»
15 years 1 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 3 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...