Country: United States

Found 17049 papers in total
The compactness of a policy space in dynamic programming via an extension theorem for Caratheodory functions
The compactness of a policy space in dynamic programming via an extension theorem for Caratheodory functions
1997,
The background for this paper is a dynamic programming model with a Borel state space...
Knowledge-based system for telecontrol of anaerobic wastewater treatment plants
Knowledge-based system for telecontrol of anaerobic wastewater treatment plants
2000,
This paper describes the design and implementation of an intelligent real-time...
Existence and discovery of average optimal solutions in deterministic infinite horizon optimization
Existence and discovery of average optimal solutions in deterministic infinite horizon optimization
1998,
We consider the problem of making a sequence of decisions, each chosen from a finite...
Coordination of intelligent agents in real-time search
Coordination of intelligent agents in real-time search
2002,
Search is a fundamental problem-solving method in artificial intelligence. Traditional...
Solving the 0/1 knapsack problem using an adaptive genetic algorithm
Solving the 0/1 knapsack problem using an adaptive genetic algorithm
2002,
Probabilistic and stochastic algorithms have been used to solve many hard optimization...
A model of a decision support system based on case-based reasoning for third-party logistics evaluation
A model of a decision support system based on case-based reasoning for third-party logistics evaluation
2003,
The social demands for third-party logistics (3PL) are further developing the model of...
Knowledge representation in an activated sludge plant diagnosis system
Knowledge representation in an activated sludge plant diagnosis system
2000,
This paper focuses on the knowledge representation framework utilized by an integrated...
On Barvinok's algorithm for counting lattice points in fixed dimension
On Barvinok's algorithm for counting lattice points in fixed dimension
1997,
We describe a simplification of a recent polynomial-time algorithm of A.I. Barvinok...
Integral solutions of linear complementarity problems
Integral solutions of linear complementarity problems
1998,
We characterize the class of integral square matrices M having the property that for...
Persistency in 0–1 polynomial programming
Persistency in 0–1 polynomial programming
1998,
An optimal solution to the continuous relaxation of a mixed-integer 0–1 linear...
Maximum entropy reconstruction using derivative information, 1. Fisher information and convex duality
Maximum entropy reconstruction using derivative information, 1. Fisher information and convex duality
1996,
Maximum entropy spectral density estimation is a technique for reconstructing an...
Integer solution for linear complementarity problem
Integer solution for linear complementarity problem
1998,
We consider the problem of finding an integer solution to a linear complementarity...
Sequential decision-theoretic models and expert systems
Sequential decision-theoretic models and expert systems
2002,
Sequential decision models are an important component of expert systems since, in...
A simplicial approach to the determination of an integer point of a simplex
A simplicial approach to the determination of an integer point of a simplex
1998,
We propose an algorithm to find an integer point of a simplex. The algorithm is based...
Combining problem structure with basis reduction to solve a class of hard integer programs
Combining problem structure with basis reduction to solve a class of hard integer programs
2002,
Recently Aardal et al . have successfully solved some small, difficult,...
On ws-convergence of product measures
On ws-convergence of product measures
2001,
A number of fundamental results, centered around extensions of Prohorov's theorem, is...
The complexity of generic primal algorithms for solving general integer programs
The complexity of generic primal algorithms for solving general integer programs
2002,
Primal methods constitute a common approach to solving (combinatorial) optimization...
A polyhedral study of integer variable upper bounds
A polyhedral study of integer variable upper bounds
2002,
We study the polyhedron of the single node capacitated network design model with...
The zero duality gap property and lower semicontinuity of the perturbation function
The zero duality gap property and lower semicontinuity of the perturbation function
2002,
We examine the validity of the zero duality gap properties for two important dual...
On the convergence of the iteration sequence of infeasible path following algorithms for linear complementarity problems
On the convergence of the iteration sequence of infeasible path following algorithms for linear complementarity problems
1997,
A generalized class of infeasible-interior-point methods for solving horizontal linear...
On a wide region of centers and primal–dual interior point algorithms for linear programming
On a wide region of centers and primal–dual interior point algorithms for linear programming
1997,
In the adaptive step primal–dual interior point method for linear programming,...
Colourful linear programming and its relatives
Colourful linear programming and its relatives
1997,
We consider the following Colourful generalization of Linear Programming: given sets...
Estimation of derivatives of nonsmooth performance measures in regenerative systems
Estimation of derivatives of nonsmooth performance measures in regenerative systems
2001,
We investigate the problem of estimating derivatives of expected steady-state...
On the complexity of solving sparse symmetric linear programs specified with approximate data
On the complexity of solving sparse symmetric linear programs specified with approximate data
1997,
An algorithm that solves symmetric linear programs specified with approximate data is...
Papers per page: