: This research develops, operationalizes, and empirically tests a model for explaining/predicting the satisfaction of customers with Internet-based services in the context of an o...
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...
Dynamically reconfigurable embedded systems offer potential for higher performance as well as adaptability to changing system requirements at low cost. Such systems employ run-tim...
We describe an efficient technique to weigh word-based features in binary classification tasks and show that it significantly improves classification accuracy on a range of proble...
Justin Martineau, Tim Finin, Anupam Joshi, Shamit ...
As energy-related costs have become a major economical factor for IT infrastructures and data-centers, companies and the research community are being challenged to find better an...