With the proliferation of various kinds of sensor networks, we will see large amounts of heterogeneous data. They have different characteristics such as data content, formats, mod...
Eric Bouillet, Mark Feblowitz, Zhen Liu, Anand Ran...
We present a hybrid algorithm for distributed task allocation problem in a cooperative logistics domain. Our approach aims to achieve superior computational performance by combinin...
A range of database services are being offered on clusters of workstations today to meet the demanding needs of applications with voluminous datasets, high computational and I/O r...
The Web is the most pervasive collaborative technology in widespread use today; however, access to the web and its many applications cannot be taken for granted. Web accessibility...
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...