2752 search results - page 17 / 551 » Rounding to an Integral Program |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
JAR
2006
13 years 8 months ago
2006
Using automated reasoning techniques, we tackle the niche activity of proving that a program is free from run-time exceptions. Such a property is particularly valuable in high inte...
GECCO
2006
Springer
14 years 9 days ago
2006
Springer
A boosting algorithm based on cellular genetic programming to build an ensemble of predictors is proposed. The method evolves a population of trees for a fixed number of rounds an...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
This article is a survey of developments in algorithmic convex geometry over the past decade. These include algorithms for sampling, optimization, integration, rounding and learni...
VSTTE
2005
Springer
14 years 2 months ago
2005
Springer
We argue for the importance of tool integration in achieving the Program Verifier Grand Challenge. In particular, we argue for what we call strong integration, i.e. a co-operative...