Abstract. Software development processes are often not explicitly modelled and sometimes even chaotic. In order to keep track of the involved documents and files, engineers use So...
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Abstract. We present a novel algorithm for interface generation of software components. Given a component, our algorithm uses learning techniques to compute a permissive interface ...
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...