We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
This paper describes a custom design approach as applied to power management in an innovative course on rapid prototyping of computer systems at Carnegie Mellon. We emphasize the ...
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be ap...
This is a series of laboratory exercises designed for use in data communication, computer networking and telecommunication courses. These labs enable students to experiment with va...