831 search results - page 36 / 167 » Coalgebraic Correspondence Theory |
WSC
1997
13 years 8 months ago
1997
The paper is devoted to a brief review of a mathematical theory for the branching variance-reduction technique. The branching technique is an extension of von Neumann’s splittin...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
ENTCS
2008
13 years 7 months ago
2008
The type theory P corresponds to the logical framework LF. In this paper we present H, a variant of P where convertibility is not implemented by means of the customary conversion ...
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
ICFP
2012
ACM
11 years 9 months ago
2012
ACM
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...