Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
Rationing is an inventory policy that allows prioritization of demand classes. It enables the inventory system to provide higher service levels for critical demand classes. In thi...
Cloud computing is a computing paradigm which allows access of computing elements and storages on-demand over the Internet. Virtual Appliances, pre-configured, readyto-run applicat...
Amir Vahid Dastjerdi, Sayed Gholam Hassan Tabataba...
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...