163 search results - page 24 / 33 » Supporting ranked search in parallel search cluster networks |
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
We study peer-to-peer service networks consisting of autonomous agents who seek and provide services. To fulfill its local needs, an agent attempts to discover and select informa...
CCO
2001
Springer
14 years 13 days ago
2001
Springer
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...
CCGRID
2003
IEEE
14 years 1 months ago
2003
IEEE
Peer-to-Peer (p2p), as an emerging technology, is exerting huge influence on various application scenarios. Meanwhile, agents, assisting applications in traditional paradigm with...
IMCSIT
2010
13 years 5 months ago
2010
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...