Problem

Results: 43643



#Item
931

Revision of DL-Lite Knowledge Bases Zhe Wang, Kewen Wang, and Rodney Topor Griffith University, Australia Abstract. We address the revision problem for knowledge bases (KBs) in Description Logics (DLs). This problem has

Add to Reading List

Source URL: ceur-ws.org

- Date: 2009-07-07 04:46:34
    932

    Chapter 3 The problem of scale Exploratory data analysis is detective work–numerical detective work–or counting detective work–or graphical detective work. A detective investigating a crime needs both tools and un

    Add to Reading List

    Source URL: www.personality-project.org

    - Date: 2010-09-18 13:45:16
      933

      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
        934

        Determining the number of factors: the example of the NEO-PI-R William Revelle June 25, 2007 The number of factors to extract from a data set is a long time problem in psychometrics.

        Add to Reading List

        Source URL: www.personality-project.org

        - Date: 2007-06-25 21:30:04
          935

          Research Article Climbing the Steiner Tree—Sources of Active Information in a Genetic Algorithm for Solving the Euclidean Steiner Tree Problem Winston Ewert,1* William Dembski,2 Robert J. Marks II1

          Add to Reading List

          Source URL: robertmarks.org

          - Date: 2012-04-06 23:07:00
            936

            1 Clustering Large Probabilistic Graphs George Kollios, Michalis Potamias, Evimaria Terzi. Abstract—We study the problem of clustering probabilistic graphs. Similar to the problem of clustering standard graphs, probab

            Add to Reading List

            Source URL: www.cs.bu.edu

            - Date: 2011-11-08 12:29:47
              937

              Math508, FallJerry L. Kazdan Bonus Problem for Set 4 1. Define two real numbers x and y to be equal if |x − y| is an integer. We write x ≡ y (mod 1).

              Add to Reading List

              Source URL: www.math.upenn.edu

              - Date: 2014-09-28 08:56:19
                938

                { A new approach to hydropower development } { Table of 01 { The problem }

                Add to Reading List

                Source URL: 1hskmz3i2o5bhic6pojfb512.wpengine.netdna-cdn.com

                - Date: 2016-10-11 13:28:42
                  939

                  Recambios caldera renova micra. Often, your current problem is an accumulation of unresolved issues from a whole variety of past lives. In recambios caldera renova micra words, the danger for the RHF method is when the e

                  Add to Reading List

                  Source URL: vk-t.ru

                  - Date: 2015-07-19 22:37:01
                    940

                    Problem Solution Sustenance in XCS: Markov Chain Analysis of Niche Support Distributions and the Impact on Computational Complexity Martin V. Butz⋆ , David E. Goldberg‡ , Pier Luca Lanzi† , Kumara Sastry‡ ⋆

                    Add to Reading List

                    Source URL: www.mindraces.org

                    - Date: 2007-04-23 06:20:15
                      UPDATE