## Search

Now showing items 1-8 of 8

#### An algorithm for solving S-games and differential S-games

(Institute of Electrical and Electronic Engineers, 1982)

We present an algorithm for solving S-Games. Our
algorithm can be used to compute approximately the
value of the game as well as €-optimal strategies of
the two players. For games with similar structure to
S-games which ...

#### Gain/variability tradeoffs in undiscounted Markov Decision Processes

(Institute of Electrical and Electronic Engineers, 1985)

We consider a finite state/action Markov Decision
Process over the infinite time horizon, and with the
limiting average reward criterion. However, we are
interested not only in maximizing the above reward
criterion but ...

#### The completely mixed stochastic game

(American Mathematical Society, 1985)

We consider a zero-sum stochastic game with finitely many states and
actions. Further we assume that the transition probabilities depend on the actions of
only one player (player II, in our case), and that the game is ...

#### Player aggregation in the traveling inspector model

(Institute of Electrical and Electronic Engineers, 1985)

We consider a model of dynamic inspection/surveillance of
a number of facilities in different geographical locations. The inspector in
this process travels from one facility to another and performs an
inspection at each ...

#### A history-based scheme for accelerating Prolog interpretation

(Institute of Electrical and Electronics Engineers Computer Society (IEEE Publishing), 1989)

An algorithm for improving the performance of a Prolog interpreter is introduced. The algorithm, unlike the intelligent backtracking schemes which improve the performance by avoiding redundant redos, avoids redundant calls. ...

#### The embedding of the traveling salesman problem in a Markov Decision Process

(Institute of Electrical and Electronic Engineers, 1987)

In this paper we derive a new LP-relaxation of the Traveling
Salesman Problem (TSP, for short). This formulation
comes from first embedding the TSP in a Markov Decision
Process (MDP: for short), and from perturbing this ...

#### Algorithms for Robust Pole Assignment in Singular Systems

(Institute of Electrical and Electronics Engineers Computer Society (IEEE Publishing), 1986)

The solution of the pole assignment problem by feedback in singular systems is parameterized and conditions are given which guarantee the regularity and maximal degree of the closed loop pencil. A robustness measure is ...

#### Percentile objective criteria in limiting average Markov Control Problems

(Institute of Electrical and Electronic Engineers, 1989)

Infinite horizon Markov Control Problems, or Markov Decision
Processes (MDP's, for short), have been extensively studied since
the 1950's. One of the most commonly considered versions is
the so-called "limiting average ...