#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1973

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Key Phrases

#### Method

Learn More

- Robert A. Hearn, Erik D. Demaine
- Theor. Comput. Sci.
- 2005

We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum inflow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse the direction of a particular edge is shown to be PSPACE-complete by a reduction from Quantified Boolean Formulas. We… (More)

- Mark J Rivard, Wayne M Butler, +6 authors Jeffrey F Williamson
- Brachytherapy
- 2007

PURPOSE
In 2004, the American Association of Physicists in Medicine (AAPM) issued a report outlining recommended 125I and 103Pd datasets for consistency in calculating brachytherapy dose distributions. In 2005, to aid evaluating the clinical impact of implementing these datasets, the AAPM assessed the historical dependence of how prescribed doses differed… (More)

- Robert A. Hearn
- 2006

There is a fundamental connection between the notions of game and of computation. At its most basic level, this is implied by any game complexity result, but the connection is deeper than this. One example is the concept of alternating nondeterminism, which is intimately connected with two-player games. In the first half of this thesis, I develop the idea… (More)

- Robert A. Hearn, Erik D. Demaine
- ICALP
- 2002

We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum inflow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse the direction of a particular edge is shown to be PSPACE-complete by a reduction from Quantified Boolean Formulas. We… (More)

- ROBERT A. HEARN
- 2007

Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a useful platform for both game-theoretic study and AI games research. Buro [3] showed that simple Amazons endgames are NP-equivalent, leaving the complexity of the general case as an open problem. 1 Konane is an ancient Hawaiian game,… (More)

- Erik D. Demaine, Robert A. Hearn
- 2008 23rd Annual IEEE Conference on Computational…
- 2008

We introduce a simple game family, called constraint logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be interpreted in many different game-theoretic settings, ranging from zero-player automata to a more economic setting of team multiplayer games with hidden information. Each setting… (More)

- Erik D. Demaine, Robert A. Hearn, Michael Hoffmann
- CCCG
- 2002

We prove PSPACE-completeness of a class of pushing-block puzzles similar to the classic Sokoban, extending several previous results [1, 5, 12]. The puzzles consist of unit square blocks on an integer lattice; some of the blocks are movable. The robot may move horizontally and vertically in order to reach a specified goal position. The puzzle variants differ… (More)

- Richard Granger, Robert A. Hearn
- Scholarpedia
- 2007

- Robert A. Hearn
- ArXiv
- 2005

Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a useful platform for both game-theoretic study and AI games research. Buro [2] showed that simple Amazons endgames are NP-equivalent, leaving the complexity of the general case as an open problem. We settle this problem, by showing that… (More)

In this paper, we give a PSPACE-completeness reduction from QBF to the Dyson Telescopes Puzzle where opposing telescopes can overlap in at least two spaces. The reduction does not use tail ends of telescopes or initially partially extended telescopes. If two opposing telescopes can overlap in at most one space, we can solve the puzzle in polynomial time by… (More)