Sciweavers

427 search results - page 51 / 86
» A Subexponential Bound for Linear Programming
Sort
View
ICRA
1994
IEEE
81views Robotics» more  ICRA 1994»
14 years 1 months ago
Finding All Gravitationally Stable Orientations of Assemblies
Previous work by Mattikalli et al.[1] considered the stability of assemblies of frictionless contacting bodies with uniform gravity. A linear programming-based technique was descr...
Raju Mattikalli, David Baraff, Pradeep K. Khosla
FPGA
1995
ACM
120views FPGA» more  FPGA 1995»
14 years 13 days ago
Synthesis of Signal Processing Structured Datapaths for FPGAs Supporting RAMs and Busses
A novel approach is presented for transforming a given scheduled and bound signal processing algorithm for a multiplexer based datapath to a BUS/RAM based FPGA datapath. A datapat...
Baher Haroun, Behzad Sajjadi
NIPS
2004
13 years 10 months ago
A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
Daniela Pucci de Farias, Benjamin Van Roy
SIAMJO
2008
212views more  SIAMJO 2008»
13 years 8 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera
COCOON
2005
Springer
14 years 2 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...