<--- Back to Details
First PageDocument Content
Combinatorial optimization / Routing algorithms / Search algorithms / Binary trees / Mathematics / Computer programming / Applied mathematics / Probability / With high probability / A* search algorithm / Rope
Date: 2016-07-05 06:08:11
Combinatorial optimization
Routing algorithms
Search algorithms
Binary trees
Mathematics
Computer programming
Applied mathematics
Probability
With high probability
A* search algorithm
Rope

Rumor Spreading with Bounded In-Degree∗ Sebastian Daum, Fabian Kuhn, and Yannic Maus Deptartment of Computer Science, University of FreiburgFreiburg, Germany , {kuhn, yannic.maus}@cs.uni-

Add to Reading List

Source URL: sirocco2016.hiit.fi

Download Document from Source Website

File Size: 929,92 KB

Share Document on Facebook

Similar Documents

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

Automatic Power System Restoration Application of a Search Algorithm Lars Lindgren

DocID: 1up2e - View Document

A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

DocID: 1ueLR - View Document

A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

DocID: 1tFfm - View Document

________________________________ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem Gerardo Berbeglia Jean-François Cordeau

DocID: 1tqh4 - View Document