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...
There are p heterogeneous objects to be assigned to n competing agents (n > p)
each with unit demand. It is required to design a Groves mechanism for this assignment problem
s...
The proliferation of retail outlets with nearly identical product offerings and similar costs due to market efficiency means that selecting an appropriate market to open a store i...
Baabak Ashuri, William B. Rouse, Douglas A. Bodner
The interest among a geographically distributed user base to mine massive collections of scientific data propels the need for efficient data dissemination solutions. An optimal dat...
We propose DHCS, a method of distributed, hierarchical clustering and summarization for online data analysis and mining in sensor networks. Different from the acquisition and aggre...