2479 search results - page 246 / 496 » A Computational Theory of Working Memory |
148
click to vote
CG
2000
Springer
15 years 11 months ago
2000
Springer
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
152
click to vote
SPAA
1998
ACM
15 years 11 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
180
click to vote
EURONGI
2006
Springer
15 years 10 months ago
2006
Springer
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
165
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Automatic performance analysis of parallel programs can be accomplished by scanning event traces of program execution for patterns representing inefficient behavior. The ...
168
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...