2713 search results - page 7 / 543 » Parameterized Tree Systems |
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
MOC
2010
13 years 4 months ago
2010
We consider a parameterized family of Thue equations of degree 16. By reducing this family to a system of Pell equations and linear relations, we are able to solve this family.
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
FAW
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...