2252 search results - page 168 / 451 » Lower Bounds for Dynamic Algorithms |
150
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
206
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
122
Voted
HM
2010
Springer
15 years 4 months ago
2010
Springer
Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and dec...
109
Voted
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
220
Voted
SCHEDULING
2011
14 years 10 months ago
2011
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobsâ€...