3616 search results - page 283 / 724 » Conditional Memory Ordering |
136
click to vote
SIGMETRICS
2004
ACM
15 years 10 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
127
Voted
CG
2000
Springer
15 years 9 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...
157
click to vote
BIRTHDAY
2008
Springer
15 years 6 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
150
click to vote
CSL
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
140
click to vote
ICML
2010
IEEE
15 years 6 months ago
2010
IEEE
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...