840 search results - page 73 / 168 » Inapproximability of Combinatorial Optimization Problems |
100
click to vote
ICMLA
2009
14 years 10 months ago
2009
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
126
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
89
Voted
UAI
2004
15 years 1 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
109
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
IJAIT
2002
15 years 6 days ago
2002
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...