Finding

Results: 13371



#Item
281

3.3. Independencies in Graphs Algorithm 3.1 Algorithm for finding nodes reachable from X given Z via active trails Procedure Reachable ( G, // Bayesian network graph X, // Source variable

Add to Reading List

Source URL: pgm.stanford.edu

- Date: 2010-10-31 14:44:57
    282

    The complexity of finding arc-disjoint branching flows J Bang-Jensen, Fr´ed´eric Havet, Anders Yeo To cite this version: J Bang-Jensen, Fr´ed´eric Havet, Anders Yeo. The complexity of finding arc-disjoint

    Add to Reading List

    Source URL: hal.inria.fr

    - Date: 2016-12-25 15:28:01
      283

      Finding Semantically–Equivalent Binary Code By Synthesizing Adaptors Vaibhav Sharma, Kesha Hietala*, and Stephen McCamant, Department of Computer Science and Engineering, University of Minnesota, Twin Cities ( *now Uni

      Add to Reading List

      Source URL: www-users.cs.umn.edu

      - Date: 2016-12-05 14:01:46
        284

        Three Approaches to Finding German Valence Compounds Yannick Versley, Anne Brock, Verena Henrich, Erhard Hinrichs SFBSeminar f¨ur Sprachwissenschaft Universit¨at T¨ubingen

        Add to Reading List

        Source URL: www.oegai.at

        - Date: 2016-02-29 20:02:13
          285

          IMAGINE IF… FINDING OPPORTUNITY Choose an object or system: Consider the parts, purposes, and people who interact with your object or system, and then ask:

          Add to Reading List

          Source URL: www.agencybydesign.org

          - Date: 2016-09-26 15:49:18
            286

            A Teacher’s Guide For FINDING PERFECT For use with Common Core Standards About the Book

            Add to Reading List

            Source URL: images.macmillan.com

            - Date: 2016-05-13 03:23:52
              287

              CP-Miner: A Tool for Finding Copy-paste and Related Bugs in Operating System Code Zhenmin Li, Shan Lu, Suvda Myagmar and Yuanyuan Zhou Department of Computer Science University of Illinois at Urbana-Champaign, Urbana, IL

              Add to Reading List

              Source URL: opera.ucsd.edu

              - Date: 2009-06-05 20:04:52
                288

                Civil Discourse in America Finding common ground for the greater good Facilitator’s guide

                Add to Reading List

                Source URL: www.episcopalchurch.org

                - Date: 2014-11-30 13:05:13
                  289

                  http://oac.cdlib.org/findaid/ark:/13030/tf3x0nb276 No online items Finding Aid for the Kasai Family Papers, Processed by Yoko Shimojo, with assistance from Elizabeth Sheehan, Winter 2006; machine-readable findi

                  Add to Reading List

                  Source URL: pdf.oac.cdlib.org

                  - Date: 2015-10-29 19:43:53
                    290

                    Maximum Scatter TSP in Doubling Metrics L´aszl´o Kozma∗ Abstract We study the problem of finding a tour of n points in which every edge is long. More precisely, we wish to find a tour that visits every point exactly

                    Add to Reading List

                    Source URL: www.lkozma.net

                    - Date: 2016-10-27 09:33:57
                      UPDATE