Traditionally, the routing problem is addressed at the network layer, an approach that has been extended to the wireless realm. In wireless multihop networks, however, strict laye...
We address the problem of computing an optimal value function for Markov decision processes. Since finding this function quickly and accurately requires substantial computation ef...
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Generics (templates) attempt to unify similar program structures to avoid redundancy. How well do generics serve this purpose in practice? We try to answer this question through e...
Hamid Abdul Basit, Damith C. Rajapakse, Stan Jarza...
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...