494 search results - page 53 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We investigate the structure of the set of gapped motifs (repeated patterns with don’t cares) of a given string of symbols. A natural equivalence classification is int...
DAM
2006
13 years 7 months ago
2006
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
RTSS
2002
IEEE
14 years 21 days ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...