5580 search results - page 265 / 1116 » Randomized priority algorithms |
201
click to vote
SODA
2012
ACM
13 years 8 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...
165
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
198
click to vote
SAC
2003
ACM
15 years 11 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
158
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
—DARWIN is a tool that is able to synthesize CMOS opamps, on the basis of a genetic algorithm. A randomly generated initial set of opamps evolves to a set in which the topologies...
195
click to vote
CORR
2011
Springer
14 years 10 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...