14165 search results - page 390 / 2833 » The generalized two-server problem |
159
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
159
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
156
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Coverage is a fundamental problem in sensor networks. In this paper, we addressed the coverage problem from two different view points and refer to them as the worst and...
136
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
Although the interest in nature-inspired optimization of dynamic problems has been growing constantly over the past decade, very little has been done to analyze and characterize a...
195
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...