Various dynamic content caching approaches have been proposed to address the performance and scalability problems faced by many Web sites that utilize dynamic content generation a...
Anindya Datta, Kaushik Dutta, Helen M. Thomas, Deb...
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
Recently wireless web services have been rapidly growing as a new way of information service. As the wireless Internet access grows, so do e-commerce opportunities through the wir...
This paper proposes the IP Multicast-enabled Drop Groups (I-DG) protocol as a solution to the problem of efficiently and securely disseminating information to a large number of s...
The current situation in the Internet service provider market shows that Internet service providers (ISPs) are still struggling to find sustainable business models. The challenge ...
How to conduct automated business negotiation over the Internet is an important issue for agent research. In most bilateral negotiation models, two negotiation agents negotiate by...
“Garbage in. garbage out” is a well-known phrase in computer analysis, and one that comes to mind when mining Web data to draw conclusions about Web users. The challenge is th...
In the web context, it is difficult to disentangle presentation from process logic, and sometimes even data is not separate from the presentation. Consequently, it becomes to de...
Abstract. Combinatorial exchanges have attracted much attention recently. However, to this point there is no generally accepted payment allocation algorithm capable of clearing com...