17 search results - page 3 / 4 » A decidable characterization of the classes between lintime ... |
FUIN
2010
13 years 5 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
ICALP
2007
Springer
14 years 26 days ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
ATAL
2003
Springer
13 years 12 months ago
2003
Springer
In this paper we study a class of resource allocation games which are inspired by the El Farol Bar problem. We consider a system of competitive agents that have to choose between ...
DAGSTUHL
2007
13 years 8 months ago
2007
A (randomized, anonymous) voting rule maps any multiset of total orders (aka. votes) over a fixed set of alternatives to a probability distribution over these alternatives. A voti...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
An epidemic spreading in a network calls for a decision on the part of the network members: They should decide whether to protect themselves or not. Their decision depends on the ...