Complexity

Results: 8084



#Item
191

Minimizing Wiggles in Storyline Visualizations Theresa Fr¨oschl and Martin N¨ollenburg Algorithms and Complexity Group, TU Wien, Vienna, Austria A storyline visualization is a two-dimensional drawing of a special kind

Add to Reading List

Source URL: www.ac.tuwien.ac.at

Language: English - Date: 2018-01-25 04:27:40
    192

    Automated Abstraction of Labeled Petri Nets Kevin Jones University of Utah Abstract- Due to the increasing use and complexity of embedded and cyber-physical systems, proper validation of the

    Add to Reading List

    Source URL: www.async.ece.utah.edu

    Language: English - Date: 2015-11-04 17:38:56
      193

      ARTICLES PUBLISHED ONLINE: 22 FEBRUARY 2016 | DOI: NCHEM.2462 Encoding complexity within supramolecular analogues of frustrated magnets Andrew B. Cairns1,2, Matthew J. Cliffe1,3, Joseph A. M. Paddison1,4,5, Domin

      Add to Reading List

      Source URL: coudert.name

      Language: English - Date: 2016-04-22 10:40:27
        194

        Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org ON THE COMPLEXITY OF ELEMENTARY MODAL LOGICS EDITH HEMASPAANDRA AND HENNING SCHNOOR Department of Computer Science, Roc

        Add to Reading List

        Source URL: drops.dagstuhl.de

        Language: English - Date: 2008-02-05 06:40:10
          195

          Towards Characterizing Strict Outerconfluent Graphs Fabian Klute and Martin N¨ollenburg Algorithms and Complexity Group, TU Wien, Vienna, Austria Confluent drawings of graphs are geometric representations in the plane,

          Add to Reading List

          Source URL: www.ac.tuwien.ac.at

          Language: English - Date: 2018-01-25 04:30:49
            196

            KAY SEKIMACHI: SIMPLE COMPLEXITY Works from the Forrest L. Merrill Collection FOR IMMEDIATE RELEASE Contact: Sasha Ali

            Add to Reading List

            Source URL: cafam.org

            Language: English - Date: 2018-01-08 16:05:16
              197

              On  Finite-­‐)me  Convergent  Gossip  Algorithms:   Existence,  Complexity,  and  Some  Applica)ons   Guodong  Shi   Automa)c  Control,  Electrical  Engineering   KTH

              Add to Reading List

              Source URL: users.cecs.anu.edu.au

              Language: English - Date: 2015-07-27 22:40:01
                198

                The simple, little and slow things count: On parameterized counting complexity Radu Curticapean Dissertation for Obtaining the Title of Doctor rerum naturalium (Dr. rer. nat)

                Add to Reading List

                Source URL: www-cc.cs.uni-saarland.de

                Language: English - Date: 2015-08-03 09:11:15
                  199

                  Minicourse on parameterized algorithms and complexity Part 6: Important Separators Dániel Marx Jagiellonian University in Kraków

                  Add to Reading List

                  Source URL: www.cs.bme.hu

                  Language: English - Date: 2015-04-21 11:03:11
                    200

                    198:538 Complexity of Computation Rutgers University, Spring 2007 Homework 1 due Tuesday 6 February

                    Add to Reading List

                    Source URL: www.cse.cuhk.edu.hk

                    Language: English - Date: 2008-09-12 04:19:11
                      UPDATE