Book:Graph Algorithms

Results: 27



#Item
1Faster  parallel  Graph  BLAS  kernels  and  new   graph  algorithms  in  matrix  algebra   Aydın  Buluç   Computa1onal  Research  Division   Berkeley  Lab  (LBN

Faster  parallel  Graph  BLAS  kernels  and  new   graph  algorithms  in  matrix  algebra   Aydın  Buluç   Computa1onal  Research  Division   Berkeley  Lab  (LBN

Add to Reading List

Source URL: gauss.cs.ucsb.edu

Language: English - Date: 2015-10-13 13:40:37
2Chaplick, Steven Curriculum Vitae June 2016 Address: Lehrstuhl für Informatik I, Universität Würzburg, Am Hubland, DWürzburg, Germany.

Chaplick, Steven Curriculum Vitae June 2016 Address: Lehrstuhl für Informatik I, Universität Würzburg, Am Hubland, DWürzburg, Germany.

Add to Reading List

Source URL: www1.informatik.uni-wuerzburg.de

Language: English - Date: 2016-06-04 11:41:50
3Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph. In some cases, this can be accomplished by adding some sort of locality constraint and c

Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph. In some cases, this can be accomplished by adding some sort of locality constraint and c

Add to Reading List

Source URL: mmds-data.org

Language: English - Date: 2016-06-23 15:50:48
4Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati

Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati

Add to Reading List

Source URL: www.cs.siu.edu

Language: English - Date: 2015-11-12 17:19:02
5Constrained Level Generation through Grammar-Based Evolutionary Algorithms Jose M. Font*1 , Roberto Izquierdo2 , Daniel Manrique2 , and Julian Togelius3 1 U-tad, Centro Universitario de Tecnolog´ıa y Arte Digital, C/P

Constrained Level Generation through Grammar-Based Evolutionary Algorithms Jose M. Font*1 , Roberto Izquierdo2 , Daniel Manrique2 , and Julian Togelius3 1 U-tad, Centro Universitario de Tecnolog´ıa y Arte Digital, C/P

Add to Reading List

Source URL: julian.togelius.com

Language: English - Date: 2016-03-20 21:33:21
6AltAlt: Combining the Advantages of Graphplan and Heuristic State Search Romeo Sanchez Nigenda, XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZ 852

AltAlt: Combining the Advantages of Graphplan and Heuristic State Search Romeo Sanchez Nigenda, XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZ 852

Add to Reading List

Source URL: rakaposhi.eas.asu.edu

Language: English - Date: 2000-09-17 18:28:48
7Book of Abstracts 15th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms Monday-Thursday, June 22-25, 2015

Book of Abstracts 15th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms Monday-Thursday, June 22-25, 2015

Add to Reading List

Source URL: www.cri.haifa.ac.il

Language: English - Date: 2015-06-17 08:03:53
    8DM818 - Parallel Computing, Weekly Notes, Week 49  In week 49 we discussed Chapter 10 of the course book \Graph Algorithms

    DM818 - Parallel Computing, Weekly Notes, Week 49  In week 49 we discussed Chapter 10 of the course book \Graph Algorithms".  The exercises to be discussed in the tutorial on Thursday: rest of Chapter 9 exercises, 10.1

    Add to Reading List

    Source URL: www.imada.sdu.dk

    - Date: 2009-11-30 07:56:22
      9DM818 - Parallel Computing, Weekly Notes, Week 50  In week 50 we discussed end of Chapter 10 ( \Graph Algorithms

      DM818 - Parallel Computing, Weekly Notes, Week 50  In week 50 we discussed end of Chapter 10 ( \Graph Algorithms") of the course book and started with Chapter 11 ( \Search Algorithms for Discrete Optimization Problems"

      Add to Reading List

      Source URL: www.imada.sdu.dk

      - Date: 2009-12-08 03:51:40
        10Exam, June 6, 2011 Jesper Larsson, ITU Instructions What to bring. You can bring any written aid you want. This includes the course book and a dictionary. In fact, these two things are the only aids that make sense, so I

        Exam, June 6, 2011 Jesper Larsson, ITU Instructions What to bring. You can bring any written aid you want. This includes the course book and a dictionary. In fact, these two things are the only aids that make sense, so I

        Add to Reading List

        Source URL: itu.dk

        Language: English - Date: 2011-11-09 08:00:40