219 search results - page 5 / 44 » Solving Semi-infinite Linear Programs Using Boosting-Like Me... |
ISPD
2006
ACM
14 years 1 months ago
2006
ACM
Linear programming (LP) based methods are attractive for solving the placement problem because of their ability to model Half-Perimeter Wirelength (HPWL) and timing. However, it h...
ML
2002
ACM
13 years 7 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
PC
2008
13 years 7 months ago
2008
We present a multistage model for allocation of financial resources to bond indices in different currencies. The model was tested on historical data of interest and exchange rates...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...