Sciweavers

3221 search results - page 178 / 645
» Termination of Linear Programs
Sort
View
COCOON
2005
Springer
15 years 12 months ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
EUSFLAT
2007
124views Fuzzy Logic» more  EUSFLAT 2007»
15 years 7 months ago
Mixed Integer Programming, General Concept Inclusions and Fuzzy Description Logics
Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structured knowledge with vague concepts. In [23], a solution based on Mixed Integer Linear Progr...
Umberto Straccia, Fernando Bobillo
TSMC
2008
140views more  TSMC 2008»
15 years 6 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 5 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
15 years 1 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