1716 search results - page 285 / 344 » Proving Conditional Termination |
97
Voted
CORR
2006
Springer
15 years 25 days ago
2006
Springer
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
104
Voted
EJC
2006
15 years 24 days ago
2006
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a p...
117
Voted
ENTCS
2006
15 years 24 days ago
2006
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
101
Voted
ENTCS
2006
15 years 24 days ago
2006
The maintenance of organisation is a prerequisite for all viable systems in dynamic environments. In many living systems this organisation is, in part, achieved through coordinati...
85
Voted
EOR
2006
15 years 24 days ago
2006
Deckling, cutting stock or trim loss problems arise when small units are to be fitted into large ones. One aims to reduce stock usage and setups, then favors long runs, surplus ov...