Sciweavers

743 search results - page 24 / 149
» Optimal Abstraction on Real-Valued Programs
Sort
View
GECCO
2004
Springer
132views Optimization» more  GECCO 2004»
15 years 3 months ago
Grammatical Swarm
Abstract. This proof of concept study examines the possibility of specifying the construction of programs using a Particle Swarm algorithm, and represents a new form of automatic p...
Michael O'Neill, Anthony Brabazon
ICMS
2010
14 years 8 months ago
The Reformulation-Optimization Software Engine
Abstract. Most optimization software performs numerical computation, in the sense that the main interest is to find numerical values to assign to the decision variables, e.g. a so...
Leo Liberti, Sonia Cafieri, David Savourey
FSTTCS
2006
Springer
15 years 1 months ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys
ML
2010
ACM
159views Machine Learning» more  ML 2010»
14 years 8 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
SAS
2007
Springer
111views Formal Methods» more  SAS 2007»
15 years 3 months ago
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...
Ben Hardekopf, Calvin Lin