1055 search results - page 186 / 211 » Enumerations in computable structure theory |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
We use a constrained optimization framework to derive fundamental scaling laws for both unstructured sensor networks (which use blind sequential search for querying) and structure...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
CIBCB
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— This paper presents a parametric model to estimate the DNA-protein binding time using the DNA and protein structures and details of the binding site. To understand the ...
IJCAI
1993
13 years 9 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...