9842 search results - page 310 / 1969 » The Complexity of the Matching-Cut Problem |
113
Voted
EAI
2004
15 years 5 months ago
2004
Abstract: Web services are increasingly used to integrate heterogeneous and autonomous applications in cross-organizational cooperations. A key problem is to support a high executi...
133
Voted
NIPS
2004
15 years 5 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
108
click to vote
DAM
2008
15 years 3 months ago
2008
In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation...
111
click to vote
ENTCS
2008
15 years 3 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
113
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...