9842 search results - page 134 / 1969 » The Complexity of the Matching-Cut Problem |
LATIN
1998
Springer
14 years 2 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
ECP
1997
Springer
14 years 2 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
VL
1996
IEEE
14 years 2 months ago
1996
IEEE
An often-mentioned advantage of rule-based programming languages is that a program can be extended simply by adding a few more rules. In practice however, the rules tend to be dep...
CSR
2006
Springer
14 years 1 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
PRICAI
2000
Springer
14 years 1 months ago
2000
Springer
The automated prediction of a user's interests and requirements is an area of interest to the Artificial Intelligence community. However, current predictive statistical approa...