Sciweavers

1274 search results - page 73 / 255
» N-fold integer programming
Sort
View
IOR
2010
86views more  IOR 2010»
13 years 8 months ago
Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
Lewis Ntaimo
ICST
2009
IEEE
13 years 7 months ago
Euclide: A Constraint-Based Testing Framework for Critical C Programs
Euclide is a new Constraint-Based Testing tool for verifying safety-critical C programs. By using a mixture of symbolic and numerical analyses (namely static single assignment for...
Arnaud Gotlieb
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 10 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 10 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
EUROGP
2005
Springer
122views Optimization» more  EUROGP 2005»
14 years 3 months ago
Evolution of Robot Controller Using Cartesian Genetic Programming
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
Simon Harding, Julian F. Miller