Algorithm

Results: 17634



#Item
361

An ILP based Algorithm for Optimal Customer Selection for Demand Response in SmartGrids Sanmukh R. Kuppannagari Rajgopal Kannan

Add to Reading List

Source URL: ganges.usc.edu

- Date: 2016-02-12 14:24:45
    362

    A SAT based algorithm for the matching problem in bigraphs with sharing Michele Sevegnani, Chris Unsworth, and Muffy Calder Department of Computing Science, University of Glasgow, UK {michele,chrisu,muffy}@dcs.gla.ac.uk

    Add to Reading List

    Source URL: www.dcs.gla.ac.uk

    - Date: 2010-05-25 10:29:13
      363

      Catena 46 Ž–176 www.elsevier.comrlocatercatena A fast, simple and versatile algorithm to fill the depressions of digital elevation models Olivier Planchon a,) , Frederic

      Add to Reading List

      Source URL: horizon.documentation.ird.fr

      - Date: 2013-10-16 11:52:30
        364

        WIB.1 A Hierarchical Algorithm for

        Add to Reading List

        Source URL: www.eyetap.org

        - Date: 2013-11-18 07:48:25
          365

          A policy iteration algorithm for computing fixed points in static analysis of programs A. Costan† , S. Gaubert∗ , E. Goubault+ , M. Martel+ , S. Putot+ 1 2

          Add to Reading List

          Source URL: www.cmap.polytechnique.fr

          - Date: 2005-09-13 04:32:17
            366

            A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time arXiv:1301.6628v1 [cs.DS] 28 JanJonathan A. Kelner

            Add to Reading List

            Source URL: arxiv.org

            - Date: 2013-01-28 20:23:11
              367

              In this talk, we present passivity-based perspectives for distributed optimization. In the former half, we address a class of distributed optimization problems, and design a distributed algorithm based on so-called PI co

              Add to Reading List

              Source URL: www.eecs.ucf.edu

              - Date: 2016-12-07 11:39:30
                368

                A Primal-Dual Active-Set Algorithm for Bilaterally Constrained Total Variation Deblurring and Piecewise Constant Mumford-Shah Segmentation Problems D. Krishnan∗ Quang Vinh Pham∗

                Add to Reading List

                Source URL: www.cs.nyu.edu

                - Date: 2009-04-16 15:45:39
                  369

                  Appendix - Algorithm for expansion policy Algorithm 1: Search candidates for named entities and expansion policy Data: N = {N1 , N2Nn } sorted in ascending order of their string length, trigram similarity threshol

                  Add to Reading List

                  Source URL: titan.informatik.uni-leipzig.de

                  - Date: 2014-07-10 08:59:07
                    370

                    From: AAAI-00 Proceedings. Copyright © 2000, AAAI (www.aaai.org). All rights reserved. Estimating Word Translation Probabilities from Unrelated Monolingual Corpora Using the EM Algorithm Philipp Koehn and Kevin Knight

                    Add to Reading List

                    Source URL: www.aaai.org

                    - Date: 2006-01-10 22:50:02
                      UPDATE