500 search results - page 56 / 100 » Approximation algorithms for maximum independent set of pseu... |
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
Genetic algorithms—a class of stochastic population-based optimization techniques—have been widely realized as the effective tools to solve complicated optimization problems ...
151
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
120
Voted
CSDA
2011
14 years 8 months ago
2011
In this article we consider the statistical inferences of the unknown parameters of a Weibull distribution when the data are Type-I censored. It is well known that the maximum lik...
132
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
138
Voted
UAI
2008
15 years 3 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...