Sciweavers

2652 search results - page 109 / 531
» Privacy-preserving linear programming
Sort
View
TSMC
2008
140views more  TSMC 2008»
15 years 3 months ago
Adaptive Feedback Control by Constrained Approximate Dynamic Programming
A constrained approximate dynamic programming (ADP) approach is presented for designing adaptive neural network (NN) controllers with closed-loop stability and performance guarante...
S. Ferrari, J. E. Steck, R. Chandramohan
OL
2007
133views more  OL 2007»
15 years 2 months ago
An SQP-type algorithm for nonlinear second-order cone programs
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
Hirokazu Kato, Masao Fukushima
TSMC
2010
14 years 9 months ago
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
Giovanni Righini, Emanuele Tresoldi
CADE
2006
Springer
16 years 3 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
ECWEB
2003
Springer
104views ECommerce» more  ECWEB 2003»
15 years 8 months ago
e-Procurement Using Goal Programming
Abstract. e-Procurement is an Internet-based business process for obtaining materials and services and managing their inflow into the organization. In this paper we develop multia...
S. Kameshwaran, Y. Narahari