14165 search results - page 617 / 2833 » The generalized two-server problem |
161
click to vote
JGAA
2006
15 years 7 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
163
click to vote
LMCS
2006
15 years 7 months ago
2006
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
193
click to vote
TCS
2008
15 years 7 months ago
2008
We address the problem of detecting consensus motifs, that occur with subtle variations, across multiple sequences. These are usually functional domains in DNA sequences such as t...
170
click to vote
DSS
2002
15 years 7 months ago
2002
We identify and address a fundamental general problem which we regard as crucial for the widespread, effective use of decision support systems (DSS) in the future: how can we subs...
190
click to vote
JAR
2002
15 years 6 months ago
2002
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...