Tree-depth - PDFSEARCH.IO - Document Search Engine

Tree-depth
Results: 64

#	Item
31	The Lengauer Tarjan Algorithm for Computing the Immediate Dominator Tree of a Flowgraph by Martin Richards Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2005-09-15 08:42:42 Search algorithms Graph connectivity Compiler construction Dominator Depth-first search Tree Bridge Node Graph theory Mathematics Combinatorics
32	Chapter 3 Decompositions of graphs 3.1 Why graphs? A wide range of problems can be expressed with clarity and precision in the concise pictorial language of graphs. For instance, consider the task of coloring a politica Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2006-10-03 04:59:02 Adjacency matrix Depth-first search Directed acyclic graph Tree Connected component Vertex Directed graph Adjacency list Connectivity Graph theory Graph connectivity Graph
33	Influential Community Search in Large Networks Rong-Hua Li† , Lu Qin‡ , Jeffrey Xu Yu∗ , and Rui Mao† † Guangdong Province Key Laboratory of Popular High Performance Computers, Shenzhen University, China ‡ Add to Reading List Source URL: www.vldb.org Language: English - Date: 2014-12-17 10:03:05 Search algorithms Degeneracy Tree Connectivity Depth-first search Degree NP-complete problems Spanning tree Graph coloring Graph theory Mathematics Theoretical computer science
34	Symbiosis of Search and Heuristics for Random 3-SAT Sid Mijnders, Boris de Wilde, and Marijn J. H. Heule ! Delft University of Technology, Delft, The Netherlands Abstract. When combined properly, search techniques can re Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 08:06:00 Graph theory Binary trees Heuristic function Heuristics Heuristic Boolean satisfiability problem Depth-first search Binary search tree Tree traversal Theoretical computer science Mathematics Search algorithms
35	Efficient Regression of General-Activity Human Poses from Depth Images Ross Girshick†? Jamie Shotton† Pushmeet Kohli† † Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2013-05-01 18:04:34 Computational statistics Random forest Regression analysis Tree Decision tree learning Object recognition Segmentation Decision trees Artificial intelligence Statistics
36	Details on discrimination algorithm for IUPAC model Geir Kjetil Sandve, Osman Abul, Vegard Walseng and Finn Drabløs The search space of IUPAC motifs is explored depth-first in a (implicit) search tree where each level o Add to Reading List Source URL: www.ncbi.nlm.nih.gov Language: English Computational complexity theory Algorithm Mathematical logic Reduction P String Theoretical computer science Applied mathematics Mathematics
37	Best-First Fixed-Depth Minimax Algorithms Aske Plaat, Erasmus University, [removed] Jonathan Schaeffer, University of Alberta, [removed] Wim Pijls, Erasmus University, [removed] Ari Add to Reading List Source URL: wiki.cs.pdx.edu Language: English - Date: 2009-03-28 16:22:33 Mathematics Information science Negascout Alpha-beta pruning SSS* Minimax Transposition table B-tree Game tree Search algorithms Game artificial intelligence Artificial intelligence
38	Robust Execution of Contingent, Temporally Flexible Plans Add to Reading List Source URL: www.aaai.org Language: English - Date: 2006-07-09 01:49:28 Search algorithms Tree traversal Bellman–Ford algorithm Distributed computing Depth-first search Tree Connectivity Bridge Shortest path problem Mathematics Graph theory Theoretical computer science
39	The Advantages of Multiple Parallelizations in Cornbinatorial Search* ^Computer Science Department, Oregon State University, Corvallis, Oregon[removed]; and ^.Computer Science Department, University of Rochester, Roche Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2004-06-20 01:31:37 Parallel computing Degree Data parallelism Tree Graph HPCC Depth-first search Vertex Scalable parallelism Graph theory Mathematics Computing
40	BEYOND DATA PARALLELISM The Advantages of Multiple Parallelizations in Combinatorial Search Lawrence A. Crowl Mark Crovella· Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2011-03-28 14:53:45 Graph Depth-first search Parallel computing Tree Connectivity Pseudoforest Edge coloring Graph theory Mathematics Degree