Alexa M. Sharp

Learn More
A typical algorithm for a combinatorial optimization problem is given a static set of input, and finds a single solution. This kind of algorithm cannot be used, however, in situations where the input and solutions change over time due to evolving constraints. This dissertation explores incremental problems, one class of optimization problems that deals with(More)
1. SUMMARY The year was 1994; the place, Phoenix Arizona. A panel session moderated by Barbara Boucher Owens entitled New Models for the CS1 Course: What Are They and Are They Leading to the Same Place? [1] took place before a packed audience at SIGCSE '94. At the time, the World Wide Web was just over the horizon, and disk drives held at most a few hundred(More)
  • 1