501 search results - page 45 / 101 » Scheduling Abstractions for Local Search |
151
click to vote
SISAP
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
111
click to vote
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
SAT
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
101
click to vote
WEA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
123
click to vote
PPSN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...