Algorithm

Results: 17634



#Item
411

Paxos Made Simple Leslie Lamport 01 Nov 2001 Abstract The Paxos algorithm, when presented in plain English, is very simple.

Add to Reading List

Source URL: nil.csail.mit.edu

- Date: 2015-01-05 06:37:33
    412

    Algorithms and Data Structures Winter TermExercises for Unit 3 1. We have seen that any algorithm that finds the minimum and maximum of n keys simulta 3n 

    Add to Reading List

    Source URL: www-tcs.cs.uni-sb.de

    - Date: 2016-02-29 11:55:50
      413

      Parallel A* pathfinding algorithm Giuseppe Accaputo Pascal Iselin December 16, 2013

      Add to Reading List

      Source URL: spcl.inf.ethz.ch

      - Date: 2014-01-10 05:34:47
        414

        A simple local 3-approximation algorithm for vertex cover

        Add to Reading List

        Source URL: www.dcg.ethz.ch

        - Date: 2014-09-26 08:28:55
          415

          Biased Tadpoles: a Fast Algorithm for Centralizers in Large Matrix Groups Daniel Kunkle Gene Cooperman Northeastern University Boston, USA 02115

          Add to Reading List

          Source URL: issac2009.kias.re.kr

          - Date: 2009-07-30 00:25:42
            416

            An Ant Colony Optimisation Algorithm for the Set Packing Problem Xavier GANDIBLEUX1,2 , Xavier DELORME2 and Vincent T’KINDT3 (1) LINA - Laboratoire d’Informatique de Nantes Atlantique Universite de Nantes 2 rue de la

            Add to Reading List

            Source URL: www.emse.fr

            - Date: 2005-08-29 12:03:32
              417

              International Journal of Computer System (ISSN: ), Volume 02– Issue 01, January, 2015 Available at http://www.ijcsonline.com/ Performance Evaluation of Ant Colony Optimization and Genetic Algorithm for Facial

              Add to Reading List

              Source URL: www.ijcsonline.com

              - Date: 2015-09-16 08:57:58
                418

                AN ADAPTIVE GRID CONTOURING ALGORITHM James A. Downing, II Steven Zoraster ZYCOR, IncSouth IH-35

                Add to Reading List

                Source URL: mapcontext.com

                - Date: 2008-08-29 23:40:14
                  419

                  No Random Access Algorithm (NRA) •  Algorithm –  Access all lists sequentially (SA), in parallel –  After each cursor move compute •  Worst-case score W(r), best-case score B(r) for each seen r •  Sor

                  Add to Reading List

                  Source URL: exmo.inria.fr

                  - Date: 2015-12-01 08:01:29
                    420

                    AN ALTERNATING MINIMIZATION ALGORITHM FOR NON-NEGATIVE MATRIX APPROXIMATION JOEL A. TROPP Abstract. Matrix approximation problems with non-negativity constraints arise during the analysis of high-dimensional non-negative

                    Add to Reading List

                    Source URL: users.cms.caltech.edu

                    - Date: 2007-09-11 17:01:53
                      UPDATE