Sciweavers

1619 search results - page 122 / 324
» Structure in the Space of Value Functions
Sort
View
ESOP
2006
Springer
15 years 10 months ago
Haskell Is Not Not ML
We present a typed calculus IL ("intermediate language") which supports the embedding of ML-like (strict, eager) and Haskell-like (non-strict, lazy) languages, without fa...
Ben Rudiak-Gould, Alan Mycroft, Simon L. Peyton Jo...
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
15 years 1 months ago
Generalized efficiency bounds in distributed resource allocation
Game theory is emerging as a popular tool for distributed control of multiagent systems. In order to take advantage of these game theoretic tools the interactions of the autonomous...
Jason R. Marden, Tim Roughgarden
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
16 years 5 hour ago
Accurate Step Counting
Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevan...
Catherine Hope, Graham Hutton
ISCAS
2003
IEEE
123views Hardware» more  ISCAS 2003»
15 years 11 months ago
Fast prototyping of reconfigurable architectures from a C program
Rapid evaluation and design space exploration at the algorithmic level are important issues in the design cycle. In this paper we propose an original area vs delay estimation meth...
Sebastien Bilavarn, Guy Gogniat, Jean Luc Philippe...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 1 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day