Peter Koppstein

Learn More
In this paper, we consider the problem of assigning tasks to operators according to a large set of constraints that include time sensitivity and travel optimization. Our practical instance of this problem combines computational complexity (scheduling the tasks for one technician is NP-hard and little is known about getting a solution [CK92]) and size(More)
Some readers of the recent note by Ehud Shapiro on "Playing Master Mind Logically" (SIGART 85, July 1983) may reasonably have concluded that Prolog was a suitable language for a "generate and test" strategy, as the author stated, but that perhaps there was something intrinsic to Prolog that made anything much more subtle unwieldy. The present note at any(More)
Many problems in the telecommunication business and elsewhere seem to resist an object-oriented approach. Although objects and classes are easily identified and requirements can be mapped into methods, the object-oriented paradigm does not shed much light on how to solve problems with combinatorial computational complexity. On the other hand, these problems(More)
  • 1