2436 search results - page 31 / 488 » Comonadic Notions of Computation |
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
ISLPED
2000
ACM
13 years 12 months ago
2000
ACM
We introduce the notion of energy scalable computation on general purpose processors. The principle idea is to maximize computational quality for a given energy constraint. The de...
CORR
2007
Springer
13 years 7 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....
CSFW
2007
IEEE
14 years 1 months ago
2007
IEEE
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
TAPSOFT
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. We introduce the notion of strongly concatenable process as a refinement of concatenable processes [3] which can be expressed axiomatically via a functor Q[ ] from the c...