5138 search results - page 27 / 1028 » Randomized Algorithms for 3-SAT |
SODA
2010
ACM
15 years 6 months ago
2010
ACM
SODA
2010
ACM
15 years 6 months ago
2010
ACM
SODA
2012
ACM
12 years 12 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
104
click to vote
ICC
2011
IEEE
13 years 9 months ago
2011
IEEE
—We consider a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random ...