389 search results - page 3 / 78 » Some natural decision problems in automatic graphs |
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
MKM
2007
Springer
13 years 11 months ago
2007
Springer
We address the problem of automatic synthesis of decision procedures. Our synthesis mechanism consists of several stages and submechanisms and is well-suited to the proof-planning ...
CORR
2012
Springer
12 years 17 days ago
2012
Springer
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
IWPSE
2003
IEEE
13 years 10 months ago
2003
IEEE
The number of software systems is increasing at a rapid rate. For example, SourceForge currently has about sixty thousand software systems registered, twenty-two thousand of which...
IJAR
2010
13 years 3 months ago
2010
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...