Greedy algorithms exploit problem structure and constraints to achieve linear-time performance. Yet there is still no completely satisfactory way of constructing greedy algorithms. For example, the Greedy Algorithm of Edmonds depends upon translating a problem into an algebraic structure called a matroid, but the existence of such a translation can be as hard to determine as the existence of a greedy algorithm itself. An alternative characterization of greedy algorithms is in terms of dominance...

Topics: NASA Technical Reports Server (NTRS), GREEDY ALGORITHMS, OPTIMIZATION, SEARCHING, DOMINANCE,...

A framework to compare and evaluate diagnosis algorithms (DAs) has been created jointly by NASA Ames Research Center and PARC. In this paper, we present the first concrete implementation of this framework as a competition called DXC 09. The goal of this competition was to evaluate and compare DAs in a common platform and to determine a winner based on diagnosis results. 12 DAs (model-based and otherwise) competed in this first year of the competition in 3 tracks that included industrial and...

Topics: NASA Technical Reports Server (NTRS), SOFTWARE RELIABILITY, FAULT DETECTION, GREEDY ALGORITHMS,...

34,214
34K

Feb 3, 2016
02/16

by
MIT OpenCourseWare

movies

#
eye 34,214

#
favorite 12

#
comment 0

View the complete course: http://ocw.mit.edu/6-046JS15 Instructors: Erik Demaine, Srinivas Devadas, Nancy Ann Lynch 6.046 introduces students to the design of computer algorithms, as well as analysis of sophisticated algorithms. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Topics: algorithm, sorting, search trees, heaps, hashing, divide and conquer, dynamic programming, greedy...

This paper describes a tool for intersecting context-free grammars. Since this problem is undecidable the tool follows a refinement-based approach and implements a novel refinement which is complete for regularly separable grammars. We show its effectiveness for safety verification of recursive multi-threaded programs.

Topics: NASA Technical Reports Server (NTRS), CONTEXT FREE LANGUAGES, GRAMMARS, PROGRAM VERIFICATION...

An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or...

Topics: NASA Technical Reports Server (NTRS), DISCRIMINANT ANALYSIS (STATISTICS), LINEARITY, GREEDY...

This paper addresses the problem of detecting and describing anomalies in large sets of high-dimensional symbol sequences. The approach taken uses unsupervised clustering of sequences using the normalized longest common subsequence (LCS) as a similarity measure, followed by detailed analysis of outliers to detect anomalies. As the LCS measure is expensive to compute, the first part of the paper discusses existing algorithms, such as the Hunt-Szymanski algorithm, that have low time-complexity....

Topics: NASA Technical Reports Server (NTRS), ANOMALIES, DETECTION, SYMBOLS, MACHINE LEARNING, SEQUENTIAL...

Companion Website http://www.cs.princeton.edu/~wayne/kleinberg-tardos/ Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science. Chapter 1 Introduction: Some Representative Problems...

Topics: Introduction: Some Representative Problems, Basics of Algorithm Analysis, Graphs, Greedy...