Sciweavers

2652 search results - page 56 / 531
» Privacy-preserving linear programming
Sort
View
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
15 years 10 months ago
Random walks on polytopes and an affine interior point method for linear programming
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...
Ravi Kannan, Hariharan Narayanan
ECP
1997
Springer
128views Robotics» more  ECP 1997»
15 years 1 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
COMPGEOM
1992
ACM
15 years 1 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
INFOCOM
2010
IEEE
14 years 8 months ago
Linear Programming Models For Multi-Channel P2P Streaming Systems
Abstract—Most of the commercial P2P video streaming deployments support hundreds of channels and are referred to as multichannel systems. Measurement studies show that bandwidth r...
Miao Wang, Lisong Xu, Byrav Ramamurthy
ICAL
2011
301views more  ICAL 2011»
13 years 9 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...