7930 search results - page 249 / 1586 » Greedy in Approximation Algorithms |
148
click to vote
SIAMCO
2000
15 years 6 months ago
2000
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
238
click to vote
OPODIS
2010
15 years 4 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
221
click to vote
AAAI
2012
13 years 9 months ago
2012
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
172
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
157
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...