4498 search results - page 516 / 900 » How to Invent Functions |
131
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
153
Voted
EOR
2010
15 years 6 months ago
2010
We discuss tournaments in terms of their efficiency as probabilistic mechanisms that select high-quality alternatives ("players") in a noisy environment. We use two crit...
167
click to vote
EOR
2008
15 years 6 months ago
2008
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preempt...
191
Voted
COGSCI
2006
15 years 6 months ago
2006
We argue that computation via quantum mechanical processes is irrelevant to explaining how brains produce thought, contrary to the ongoing speculations of many theorists. First, q...
150
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper shows how the steady-state availability and failure frequency can be calculated in a single pass for very large systems, when the availability is expressed as a product...