Fast abstract

Results: 388



#Item
1SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri? , Robert Nieuwenhuis?? , and Albert Oliveras?? Abstract. Predicate abstraction is a technique for automatically extracting finite-state abstractions for s

SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri? , Robert Nieuwenhuis?? , and Albert Oliveras?? Abstract. Predicate abstraction is a technique for automatically extracting finite-state abstractions for s

Add to Reading List

Source URL: www.lsi.upc.edu

Language: English - Date: 2006-06-09 05:24:28
2SWIFT: Predictive Fast Reroute Technical Report Thomas Holterbach∗† , Stefano Vissicchio‡ , Alberto Dainotti† , Laurent Vanbever∗ ∗ ETH Zürich, † CAIDA, UC San Diego, ‡ University College London ABSTRACT

SWIFT: Predictive Fast Reroute Technical Report Thomas Holterbach∗† , Stefano Vissicchio‡ , Alberto Dainotti† , Laurent Vanbever∗ ∗ ETH Zürich, † CAIDA, UC San Diego, ‡ University College London ABSTRACT

Add to Reading List

Source URL: swift.ethz.ch

Language: English - Date: 2017-09-11 06:28:39
    3Challenges for Fast Synthesis Procedures in SMT Andrew Reynolds1 Department of Computer Science, The University of Iowa Abstract A number of synthesis applications are made possible by automated tools for synthesis. Rece

    Challenges for Fast Synthesis Procedures in SMT Andrew Reynolds1 Department of Computer Science, The University of Iowa Abstract A number of synthesis applications are made possible by automated tools for synthesis. Rece

    Add to Reading List

    Source URL: www.cs.man.ac.uk

    Language: English - Date: 2017-07-30 15:10:48
    4Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm

    Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm

    Add to Reading List

    Source URL: www.diego-perez.net

    Language: English - Date: 2014-09-01 11:09:24
      5Analysis of Fast Adaptive Traffic Engineering Using a Feedback Control Model Ning Wu and Ao Tang Abstract— This paper analyzes fast adaptive traffic engineering from a feedback control perspective. We provide a model t

      Analysis of Fast Adaptive Traffic Engineering Using a Feedback Control Model Ning Wu and Ao Tang Abstract— This paper analyzes fast adaptive traffic engineering from a feedback control perspective. We provide a model t

      Add to Reading List

      Source URL: people.ece.cornell.edu

      Language: English - Date: 2018-01-11 16:33:50
        6Modular SMT Proofs for Fast Reflexive Checking inside Coq? Fr´ed´eric Besson, Pierre-Emmanuel Cornilleau, and David Pichardie INRIA Rennes – Bretagne Atlantique, France Abstract. We present a new methodology for exc

        Modular SMT Proofs for Fast Reflexive Checking inside Coq? Fr´ed´eric Besson, Pierre-Emmanuel Cornilleau, and David Pichardie INRIA Rennes – Bretagne Atlantique, France Abstract. We present a new methodology for exc

        Add to Reading List

        Source URL: people.rennes.inria.fr

        Language: English - Date: 2014-09-03 04:27:29
          7Fast, Ad Hoc Query Evaluations over Multidimensional Geospatial Datasets Matthew Malensek, Sangmi Pallickara, and Shrideep Pallickara, Members, IEEE Abstract—Networked observational devices and remote sensing equipment

          Fast, Ad Hoc Query Evaluations over Multidimensional Geospatial Datasets Matthew Malensek, Sangmi Pallickara, and Shrideep Pallickara, Members, IEEE Abstract—Networked observational devices and remote sensing equipment

          Add to Reading List

          Source URL: glean.cs.colostate.edu

          Language: English - Date: 2015-01-14 12:35:22
            8A Lagrangian-DNN Relaxation: a Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems Sunyoung Kim? , Masakazu Kojima† and Kim-Chuan Toh‡ October 2013 Abstract. We propose an effi

            A Lagrangian-DNN Relaxation: a Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems Sunyoung Kim? , Masakazu Kojima† and Kim-Chuan Toh‡ October 2013 Abstract. We propose an effi

            Add to Reading List

            Source URL: www.math.nus.edu.sg

            Language: English - Date: 2015-02-07 02:01:57
              9Fast Trajectory Optimization for Agile Quadrotor Maneuvers with a Cable-Suspended Payload Philipp Foehn1 , Davide Falanga1 , Naveen Kuppuswamy2 , Russ Tedrake2 , Davide Scaramuzza1 Abstract—Executing agile quadrotor ma

              Fast Trajectory Optimization for Agile Quadrotor Maneuvers with a Cable-Suspended Payload Philipp Foehn1 , Davide Falanga1 , Naveen Kuppuswamy2 , Russ Tedrake2 , Davide Scaramuzza1 Abstract—Executing agile quadrotor ma

              Add to Reading List

              Source URL: rpg.ifi.uzh.ch

              Language: English - Date: 2017-06-20 05:00:23
              10Fast Reflexive Arithmetic Tactics the linear case and beyond Fr´ed´eric Besson? Irisa/Inria, Campus de Beaulieu, 35042 Rennes Cedex, France Abstract. When goals fall in decidable logic fragments, users of proofassista

              Fast Reflexive Arithmetic Tactics the linear case and beyond Fr´ed´eric Besson? Irisa/Inria, Campus de Beaulieu, 35042 Rennes Cedex, France Abstract. When goals fall in decidable logic fragments, users of proofassista

              Add to Reading List

              Source URL: people.rennes.inria.fr

              Language: English - Date: 2014-09-03 04:27:19