3422 search results - page 357 / 685 » Random Subset Optimization |
153
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
204
Voted
VLDB
2005
ACM
16 years 4 months ago
2005
ACM
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
116
click to vote
WALCOM
2010
IEEE
15 years 11 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
120
click to vote
CCGRID
2008
IEEE
15 years 11 months ago
2008
IEEE
—We formulate the service composition problem as a multi-objective stochastic program which simultaneously optimizes the following quality of service (QoS) parameters: workflow ...
131
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
—We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooper...