16430 search results - page 255 / 3286 » On Computable Tree Functions |
136
click to vote
TCIAIG
2010
14 years 11 months ago
2010
This paper presents the recent technical advances in Monte-Carlo Tree Search for the Game of Go, shows the many similarities and the rare differences between the current best progr...
144
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
DAC
2004
ACM
16 years 5 months ago
2004
ACM
182
click to vote
WMCSA
2002
IEEE
15 years 9 months ago
2002
IEEE
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...
119
click to vote
ALENEX
2003
15 years 5 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...