1138 search results - page 155 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
108
Voted
MFCS
2010
Springer
15 years 29 days ago
2010
Springer
We introduce Transformation Games (TGs), a form of coalitional game in which players are endowed with sets of initial resources, and have capabilities allowing them to derive certa...
130
Voted
LICS
2006
IEEE
15 years 8 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
105
Voted
CAEPIA
2003
Springer
15 years 7 months ago
2003
Springer
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constr...
CONCUR
2010
Springer
15 years 3 months ago
2010
Springer
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
114
click to vote
PEPM
2010
ACM
15 years 11 months ago
2010
ACM
Pushdown systems are well understood as abstract models of programs with (recursive) procedures. Reps et al. recently extended pushdown systems into weighted pushdown systems, whi...