2016 search results - page 180 / 404 » Megamaps: Construction and Examples |
149
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In 1992, Bartholdi, Tovey, and Trick [1992] opened the study of control attacks on elections--attempts to improve the election outcome by such actions as adding/deleting candidate...
157
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
171
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
182
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
170
click to vote
DAM
2010
15 years 6 months ago
2010
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...