Sciweavers

1723 search results - page 48 / 345
» Cycling in linear programming problems
Sort
View
MP
2006
65views more  MP 2006»
15 years 2 months ago
Strong Formulations of Robust Mixed 0-1 Programming
We introduce strong formulations for robust mixed 0
Alper Atamtürk
138
Voted
DAC
2006
ACM
15 years 8 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,...
ICML
2010
IEEE
15 years 3 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...
125
Voted
RC
2002
100views more  RC 2002»
15 years 2 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee
CSC
2006
15 years 4 months ago
An Algorithm to Solve a Linear Program
: This work is about an algorithm for solving a linear program which is simple to apply. There are three algorithms in this work. The first algorithm solves a two-variable linear p...
Rajan Alex