Complexity

Results: 8084



#Item
211 Complexity of Verifying Nonblockingness in Modular Supervisory Control Tom´asˇ Masopust

1 Complexity of Verifying Nonblockingness in Modular Supervisory Control Tom´asˇ Masopust

Add to Reading List

Source URL: iccl.inf.tu-dresden.de

Language: English - Date: 2017-07-12 09:04:37
    22Complexity of Model-Checking Call-by-Value Programs Takeshi Tsukada1,2 and Naoki Kobayashi3 1 2

    Complexity of Model-Checking Call-by-Value Programs Takeshi Tsukada1,2 and Naoki Kobayashi3 1 2

    Add to Reading List

    Source URL: www.kb.is.s.u-tokyo.ac.jp

    Language: English - Date: 2016-04-18 06:57:45
      23Interplay between Short- and Long-Term Plasticity in Cell-Assembly Formation Naoki Hiratani1,2,3, Tomoki Fukai1,3,4* 1 Department of Complexity Science and Engineering, The University of Tokyo, Kashiwa, Chiba, Japan, 2 R

      Interplay between Short- and Long-Term Plasticity in Cell-Assembly Formation Naoki Hiratani1,2,3, Tomoki Fukai1,3,4* 1 Department of Complexity Science and Engineering, The University of Tokyo, Kashiwa, Chiba, Japan, 2 R

      Add to Reading List

      Source URL: nct.brain.riken.jp

      Language: English - Date: 2016-09-19 16:32:07
        24

        Embracing Complexity Major Writing Assignment 2: Placing Satrapi’s Persepolis in Context Description: As a class, we have analyzed written and visual arguments (such as ads, film, etc.). One of the hybrid written/vis

        Add to Reading List

        Source URL: ideal.uiowa.edu

        Language: English - Date: 2017-07-20 13:01:24
          25The Cognitive Complexity of OWL Justifications Matthew Horridge, Samantha Bail, Bijan Parsia, Ulrike Sattler The University of Manchester Oxford Road, Manchester, M13 9PL {matthew.horridge|bails|bparsia|

          The Cognitive Complexity of OWL Justifications Matthew Horridge, Samantha Bail, Bijan Parsia, Ulrike Sattler The University of Manchester Oxford Road, Manchester, M13 9PL {matthew.horridge|bails|bparsia|

          Add to Reading List

          Source URL: iswc2011.semanticweb.org

          Language: English - Date: 2011-09-14 09:57:32
            26Microsoft Word - Complexity uncovered - Sharon Varney Aug 07.doc

            Microsoft Word - Complexity uncovered - Sharon Varney Aug 07.doc

            Add to Reading List

            Source URL: spaceforlearning.com

            Language: English - Date: 2013-09-24 03:30:20
              27Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un

              Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un

              Add to Reading List

              Source URL: web.eecs.umich.edu

              Language: English
                28Large Bell violations from communication complexity lower bounds Gabriel Senno Joint work with with S. Laplante, M. Laurière, A. Nolin (IRIF), J. Roland (ULB)

                Large Bell violations from communication complexity lower bounds Gabriel Senno Joint work with with S. Laplante, M. Laurière, A. Nolin (IRIF), J. Roland (ULB)

                Add to Reading List

                Source URL: www.pcqc.fr

                Language: English - Date: 2016-07-08 07:27:55
                  29SESSION SCHEDULE “EVOLUTION OF CULTURE COMPLEXITY” September, 21st (9:00 – 18:30) 9:00 - 9:20 OPENING SESSION 1 SOCIAL CONSTRUCTION OF CULTURAL COMPLEXITY 9::00 Keynote speaker Tom Froese

                  SESSION SCHEDULE “EVOLUTION OF CULTURE COMPLEXITY” September, 21st (9:00 – 18:30) 9:00 - 9:20 OPENING SESSION 1 SOCIAL CONSTRUCTION OF CULTURAL COMPLEXITY 9::00 Keynote speaker Tom Froese

                  Add to Reading List

                  Source URL: ccs17.bsc.es

                  Language: English - Date: 2017-08-29 04:39:44
                    30Look into my Eyes: Using Pupil Dilation to Estimate Mental Workload for Task Complexity Adaptation Thomas Kosch, Mariam Hassib, Daniel Buschek, Albrecht Schmidt LMU Munich, Munich, Germany

                    Look into my Eyes: Using Pupil Dilation to Estimate Mental Workload for Task Complexity Adaptation Thomas Kosch, Mariam Hassib, Daniel Buschek, Albrecht Schmidt LMU Munich, Munich, Germany

                    Add to Reading List

                    Source URL: www.medien.ifi.lmu.de

                    Language: English - Date: 2018-03-26 11:10:51