Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
Roie Zivan, Uri Shapen, Moshe Zazone, Amnon Meisel...
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Abstract—Efficient delivery of multimedia contents over wireless network is essential for future communication networks. However, content distribution and network engineering ar...
Xin Ji, Jianwei Huang, Mung Chiang, Francky Cattho...
The efficient delivery of web content has been identified as a key issue of research for some time. Forward (or reverse) proxies, which are positioned along the request route from...