2436 search results - page 100 / 488 » Comonadic Notions of Computation |
141
click to vote
TCC
2009
Springer
16 years 4 months ago
2009
Springer
We provide a simple protocol for secret reconstruction in any threshold secret sharing scheme, and prove that it is fair when executed with many rational parties together with a s...
142
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. During the last two decades, monads have become an indispensable tool for structuring functional programs with computational effects. In this setting, the mathematical n...
146
Voted
FSEN
2009
Springer
15 years 10 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
113
Voted
EDOC
2006
IEEE
15 years 10 months ago
2006
IEEE
The variety of design artefacts (models) produced in a model-driven design process results in an intricate relationship between requirements and the various models. This paper pro...
111
Voted
ESCIENCE
2006
IEEE
15 years 10 months ago
2006
IEEE
: A relatively new meta-heuristic, known as extremal optimisation (EO), is based on the evolutionary science notion that poorly performing genes of an individual are replaced by ra...