This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
— We consider a resource allocation problem for spectrum sharing in cognitive radio networks. Specifically, we investigate the joint subchannel, rate and power allocation for se...
Patrick Mitran, Long Le, Catherine Rosenberg, Andr...
Proving ownership rights on outsourced relational databases is a crucial issue in today internet-based application environments and in many content distribution applications. In th...