Sciweavers

3019 search results - page 76 / 604
» Approximating the Domatic Number
Sort
View
PPSN
2004
Springer
15 years 5 months ago
Constrained Evolutionary Optimization by Approximate Ranking and Surrogate Models
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
Thomas Philip Runarsson
ICALP
2010
Springer
15 years 4 months ago
On Approximate Horn Formula Minimization
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2log1−ǫ (n) -inapproximability re...
Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Muba...
ESANN
2003
15 years 1 months ago
Fast approximation of the bootstrap for model selection
The bootstrap resampling method may be efficiently used to estimate the generalization error of a family of nonlinear regression models, as artificial neural networks. The main dif...
Geoffroy Simon, Amaury Lendasse, Vincent Wertz, Mi...
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 12 months ago
Hitting forbidden minors: Approximation and Kernelization
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra...
MP
2006
121views more  MP 2006»
14 years 11 months ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg