Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...
Travis J. Desell, David P. Anderson, Malik Magdon-...
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
This paper presents a general-purpose distributed lookup service, denoted Passive Distributed Indexing (PDI). PDI stores entries in form of (key, value) pairs in index caches loca...
Local aspects of Web search -- associating Web content and queries with geography -- is a topic of growing interest. However, the underlying question of how spatial variation is m...
Lars Backstrom, Jon M. Kleinberg, Ravi Kumar, Jasm...
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...