6,734 research outputs found

    NASA oceanic processes program

    Get PDF
    Current flight projects and definition studies, brief descriptions of individual research activities, and bibliography of referred journal articles are provided

    On the Optimization of Mixture Resolving Signal Processing Structures

    Get PDF
    Mixture resolving signal processing optimization with optimum linear detection operators and mixture resolving estimator

    Stable Marriage with Ties and Bounded Length Preference Lists

    Get PDF
    We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign graduating medical students to their first hospital posts. In such a setting, weak stability is the most common solution concept, and it is known that weakly stable matchings can have different sizes. This motivates the problem of finding a maximum cardinality weakly stable matching, which is known to be NP-hard in general. We show that this problem is solvable in polynomial time if each man's list is of length at most 2 (even for women's lists that are of unbounded length). However if each man's list is of length at most 3, we show that the problem becomes NP-hard and not approximable within some d > 1, even if each woman's list is of length at most 4

    Is It Fair to Be Fair?

    Get PDF

    The Blessing of Pain

    Get PDF

    My 104,000-Dollar Summer

    Get PDF

    Alien Registration- Gregg, Carney W. (Mapleton, Aroostook County)

    Get PDF
    https://digitalmaine.com/alien_docs/33962/thumbnail.jp
    corecore