4835 search results - page 227 / 967 » Refactoring Functional Programs |
152
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
202
Voted
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Most existing dynamic voltage scaling (DVS) schemes for multiple tasks assume an energy cost function (energy consumption versus execution time) that is independent of the task ch...
164
click to vote
ATAL
2007
Springer
16 years 17 days ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
155
click to vote
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
We present a novel solution to the inter-camera color calibration problem, which is very important for multi-camera systems. We propose a distance metric and a model function to e...
165
click to vote
DAC
1998
ACM
15 years 10 months ago
1998
ACM
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...