1054 search results - page 95 / 211 » Capacitated Domination Problem |
206
click to vote
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
In this paper, we study the evaluation of skyline queries with partially-ordered attributes. Because such attributes lack a total ordering, traditional index-based evaluation algo...
140
click to vote
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
CG
1998
Springer
15 years 7 months ago
1998
Springer
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Public...
163
click to vote
FGCS
2002
15 years 2 months ago
2002
As the practice of science moves beyond the single investigator due to the complexity of the problems that now dominate science, large collaborative and multi-institutional teams ...
104
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...