38 search results - page 1 / 8 » Deadline Spanning: A Graph Based Approach |
RTCSA
2005
IEEE
13 years 10 months ago
2005
IEEE
Microkernel based systems tend to depend heavily on IPC. This paper adresses the problem of a system response spanning more than one task in an embedded real-time system. The appr...
LATIN
1995
Springer
13 years 8 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
ICDM
2002
IEEE
13 years 9 months ago
2002
IEEE
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
ISPD
2010
ACM
13 years 11 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
PKDD
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...