Sciweavers

3221 search results - page 154 / 645
» Termination of Linear Programs
Sort
View
PLILP
1993
Springer
15 years 10 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
MP
2006
103views more  MP 2006»
15 years 6 months ago
Assessing solution quality in stochastic programs
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
Güzin Bayraksan, David P. Morton
OL
2011
332views Neural Networks» more  OL 2011»
15 years 1 months ago
A robust implementation of a sequential quadratic programming algorithm with successive error restoration
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Klaus Schittkowski
EPIA
2005
Springer
15 years 12 months ago
Revised Stable Models - A Semantics for Logic Programs
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The dist...
Luís Moniz Pereira, Alexandre Miguel Pinto
MACH
1993
15 years 7 months ago
MIKE: A Distributed object-oriented programming platform on top of the Mach micro-kernel
This paper describes the architecture and implementation of MIKE - a version of the IK distributed persistent object-oriented programming platform built on top of the Mach microke...
Miguel Castro, Nuno Neves, Pedro Trancuso, Pedro S...