Sciweavers

1477 search results - page 189 / 296
» Random Convex Programs
Sort
View
CCCG
2009
13 years 10 months ago
Clarkson's Algorithm for Violator Spaces
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Yves Brise, Bernd Gärtner
CSDA
2006
142views more  CSDA 2006»
13 years 9 months ago
Automatic approximation of the marginal likelihood in non-Gaussian hierarchical models
Fitting of non-Gaussian hierarchical random effects models by approximate maximum likelihood can be made automatic to the same extent that Bayesian model fitting can be automated ...
Hans J. Skaug, David A. Fournier
ENTCS
2006
114views more  ENTCS 2006»
13 years 9 months ago
Open-Source Model Checking
We present GMC2 , a software model checker for GCC, the opensource compiler from the Free Software Foundation (FSF). GMC2 , which is part of the GMC static-analysis and model-check...
Radu Grosu, Xiaowan Huang, Sumit Jain, Scott A. Sm...
NETWORKS
2008
13 years 9 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 8 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende