Sciweavers

2652 search results - page 19 / 531
» Privacy-preserving linear programming
Sort
View
SIAMJO
2008
93views more  SIAMJO 2008»
14 years 9 months ago
Stochastic Programs with First-Order Dominance Constraints Induced by Mixed-Integer Linear Recourse
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish clo...
Ralf Gollmer, Frederike Neise, Rüdiger Schult...
DAC
2006
ACM
15 years 3 months ago
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming
We propose a novel and efficient charge-based decoupling capacitance budgeting algorithm. Our method uses the macromodeling technique and effective radius of decoupling capacitan...
Min Zhao, Rajendran Panda, Savithri Sundareswaran,...
MP
2010
156views more  MP 2010»
14 years 8 months ago
Representing the space of linear programs as the Grassmann manifold
: Each linear program (LP) has an optimal basis. The space of linear programs can be partitioned according to these bases, so called the basis partition. Discovering the structures...
Gongyun Zhao
ISCI
1998
193views more  ISCI 1998»
14 years 9 months ago
A Parallel Implementation of Genetic Programming that Achieves Super-Linear Performance
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
David Andre, John R. Koza
ICML
2010
IEEE
14 years 10 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...