2479 search results - page 230 / 496 » A Computational Theory of Working Memory |
261
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
172
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
145
Voted
RTSS
2000
IEEE
15 years 10 months ago
2000
IEEE
The maturity of schedulabilty analysis techniquesfor fired-prioritypreemptive scheduling has enabled the consideration of timing issues at design time using a specification of the...
167
click to vote
ICFP
2008
ACM
16 years 5 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
159
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...