90,413 research outputs found

    Hospitality in the Home

    Get PDF
    PDF pages: 4

    Freezing and Using Prepared Foods

    Get PDF
    PDF pages: 1

    A Discrete and Bounded Envy-free Cake Cutting Protocol for Four Agents

    Full text link
    We consider the well-studied cake cutting problem in which the goal is to identify a fair allocation based on a minimal number of queries from the agents. The problem has attracted considerable attention within various branches of computer science, mathematics, and economics. Although, the elegant Selfridge-Conway envy-free protocol for three agents has been known since 1960, it has been a major open problem for the last fifty years to obtain a bounded envy-free protocol for more than three agents. We propose a discrete and bounded envy-free protocol for four agents

    Practices in applied phonics for grade one.

    Full text link
    Thesis (Ed.M.)--Boston Universit

    Exercises for word analysis in grade II.

    Full text link
    Thesis (Ed.M.)--Boston University N.B.: the following pages are missing: cover page; pages 374-376 at end of text
    corecore