2035 search results - page 110 / 407 » Working memory |
130
click to vote
CIDR
2009
15 years 4 months ago
2009
Recent work has shown that we can dramatically improve the performance of computer games and simulations through declarative processing: Character AI can be written in an imperati...
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernelbased Percept...
123
click to vote
JDA
2008
15 years 3 months ago
2008
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
120
click to vote
PLDI
2006
ACM
15 years 9 months ago
2006
ACM
Garbage collection has proven benefits, including fewer memoryrelated errors and reduced programmer effort. Garbage collection, however, trades space for time. It reclaims memory...
108
click to vote
IROS
2008
IEEE
15 years 9 months ago
2008
IEEE
— A series of kinodynamic sampling-based planners have appeared over the last decade to deal with high dimensional problems for robots with realistic motion constraints. Yet, of...