85 search results - page 11 / 17 » Complexity of some Path Problems in DAGs and Linear Orders |
100
Voted
CIKM
1998
Springer
15 years 3 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
TCAD
2008
14 years 11 months ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
88
Voted
ASAP
2004
IEEE
15 years 3 months ago
2004
IEEE
The Compaan compiler automatically derives a Process Network (PN) description from an application written in Matlab. The basic element of a PN is a Producer/Consumer (P/C) pair. F...
110
click to vote
INFORMS
1998
14 years 11 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
DAM
2011
14 years 6 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...