523 search results - page 92 / 105 » Decidability of string graphs |
AI
2007
Springer
14 years 9 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
Getting new security features and protocols to be widely adopted and deployed in the Internet has been a continuing challenge. There are several reasons for this, in particular ec...
TOPLAS
2008
14 years 9 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
AAAI
2012
12 years 12 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...