<--- Back to Details
First PageDocument Content
Computing / Computer programming / Binary trees / Information science / Knowledge representation / Tree / Finger tree / B-tree / 23 tree / Double-ended queue / Search tree
Date: 2014-10-28 05:49:57
Computing
Computer programming
Binary trees
Information science
Knowledge representation
Tree
Finger tree
B-tree
23 tree
Double-ended queue
Search tree

Accepted for publication in J. Functional Programming 1 Finger trees: a simple general-purpose data structure

Add to Reading List

Source URL: www.staff.city.ac.uk

Download Document from Source Website

File Size: 168,75 KB

Share Document on Facebook

Similar Documents

Thinking Fast and Slow with Deep Learning and Tree Search Thomas Anthony1, , Zheng Tian1 , and David Barber1,2 arXiv:1705.08439v4 [cs.AI] 3 Dec 2017

Thinking Fast and Slow with Deep Learning and Tree Search Thomas Anthony1, , Zheng Tian1 , and David Barber1,2 arXiv:1705.08439v4 [cs.AI] 3 Dec 2017

DocID: 1xVZc - View Document

Parameterized Deformation Sparse Coding via Tree-Structured Parameter Search Brandon Burdge, Kenneth Kreutz-Delgado Dept. of Electrical and Computer Engineering University of California San Diego , kreutz

Parameterized Deformation Sparse Coding via Tree-Structured Parameter Search Brandon Burdge, Kenneth Kreutz-Delgado Dept. of Electrical and Computer Engineering University of California San Diego , kreutz

DocID: 1vqKG - View Document

Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm

Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm

DocID: 1vdZY - View Document

Active Object Recognition via Monte Carlo Tree Search Mikko Lauri, Nikolay Atanasov, George J. Pappas, and Risto Ritala Abstract—This paper considers object recognition with a camera, whose viewpoint can be controlled

Active Object Recognition via Monte Carlo Tree Search Mikko Lauri, Nikolay Atanasov, George J. Pappas, and Risto Ritala Abstract—This paper considers object recognition with a camera, whose viewpoint can be controlled

DocID: 1v6ZD - View Document

Information Processing Letters–229 www.elsevier.com/locate/ipl Salembier’s Min-tree algorithm turned into breadth first search Wim H. Hesselink Department of Mathematics and Computing Science, Rijksuniv

Information Processing Letters–229 www.elsevier.com/locate/ipl Salembier’s Min-tree algorithm turned into breadth first search Wim H. Hesselink Department of Mathematics and Computing Science, Rijksuniv

DocID: 1uX4F - View Document