1644 search results - page 9 / 329 » Finding Dominators in Practice |
111
click to vote
JCO
2008
14 years 11 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
In this paper we give a finer separation of several known paging algorithms. This is accomplished using a new technique that we call relative interval analysis. This technique com...
ICANNGA
2007
Springer
15 years 1 months ago
2007
Springer
Significant improvement over a patented lens design is achieved using multi-objective evolutionary optimization. A comparison of the results obtained from NSGA2 and ε-MOEA is done...
174
click to vote
VLDB
2009
ACM
15 years 12 months ago
2009
ACM
Abstract The top-k dominating query returns k data objects which dominate the highest number of objects in a dataset. This query is an important tool for decision support since it ...
MANSCI
2006
14 years 11 months ago
2006
Second order stochastic dominance characterizes risk-averse preferences represented by expected utility. This paper supplies second order stochastic dominance conditions that char...