Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
Our focus this year was to investigate methods for increasing query length in interactive information searching in the Web context, and to see if these methods led to changes in t...
Nicholas J. Belkin, Colleen Cool, J. Jeng, Amymari...
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
Desktop search is an important part of personal information management (PIM). However, research in this area has been limited by the lack of shareable test collections, making cum...
Search operations in databases require some special support at the physical level. This is true for conventional databases as well as for spatial databases, where typical search o...