1138 search results - page 35 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
117
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
108
Voted
ICFEM
2009
Springer
15 years 7 days ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
135
Voted
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
96
Voted
IANDC
2010
15 years 1 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
115
click to vote
EVOW
2004
Springer
15 years 8 months ago
2004
Springer
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...