Frequent itemsets mining is a popular framework for pattern discovery. In this framework, given a database of customer transactions, the task is to unearth all patterns in the for...
Srivatsan Laxman, Prasad Naldurg, Raja Sripada, Ra...
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
We consider the problem of control traffic overhead in MANETs with long-lived connections, operating under a reactive routing protocol (e.g. AODV). In such settings, control traff...
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...