Sciweavers

65 search results - page 1 / 13
» Two Polynomial Time Algorithms for the Metro-line Crossing M...
Sort
View
GD
2008
Springer
13 years 6 months ago
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
Evmorfia N. Argyriou, Michael A. Bekos, Michael Ka...
WABI
2004
Springer
13 years 10 months ago
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
Jens Gramm
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 5 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
IPL
2002
86views more  IPL 2002»
13 years 4 months ago
A polynomial algorithm for lot-size scheduling of two type tasks
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
Mikhail Y. Kovalyov, Marcus Pattloch, Günter ...
ASPDAC
2008
ACM
200views Hardware» more  ASPDAC 2008»
13 years 7 months ago
Non-Gaussian statistical timing analysis using second-order polynomial fitting
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...
Lerong Cheng, Jinjun Xiong, Lei He