17541 search results - page 108 / 3509 » Complexity in scalable computing |
102
click to vote
MASCOTS
2004
15 years 4 months ago
2004
Queueing models are routinely used to analyze the performance of software systems. However, contrary to common assumptions, the time that a software server takes to complete jobs ...
113
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
130
click to vote
AII
1989
15 years 7 months ago
1989
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
132
click to vote
CADE
2008
Springer
15 years 5 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
151
click to vote
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...