1193 search results - page 14 / 239 » A primer of simple theories |
104
click to vote
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
105
click to vote
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
151
click to vote
IWCLS
2007
Springer
15 years 6 months ago
2007
Springer
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
104
click to vote
PPDP
2007
Springer
15 years 5 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
IMC
2003
ACM
15 years 5 months ago
2003
ACM
In network performance tomography, characteristics of the network interior are inferred by correlating end-to-end measurements. In much previous work, the presence of correlations...