- Full text PDF available (8)
- This year (0)
- Last 5 years (2)
- Last 10 years (9)
Journals and Conferences
ion. The abstractions in Gilpin et al.  range from k= 6 to k= 40 (the k is actually different in each round). The treeplex Q for the second player is also a uniform treeplex with similar characteristics. 6.5. Memory requirements. One particularly attractive feature of the EGT algorithm is the fact that the only operation performed on the matrix A is a… (More)
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a first-order gradient method based on modern smoothing techniques for non-smooth convex optimization. The algorithm requires O(1/ ) iterations to compute an -equilibrium, and the… (More)
We propose a new gradient based scheme to approximate Nash equilibria of large sequential two-player, zero-sum games. The algorithm uses modern smoothing techniques for saddle-point problems tailored specifically for the polytopes used in the Nash equilibrium problem.
We describe a specialized dynamic programming algorithm for factory crane scheduling. An innovative data structure controls the memory requirements of the state space and enables solution of problems of realistic size. The algorithm finds optimal space-time trajectories for two factory cranes or hoists that move along a single overhead track. Each crane is… (More)
Fixed-width MDDs were introduced recently as a more refined alternative for the domain store to represent partial solutions to CSPs. In this work, we present a systematic approach to MDD-based constraint programming. First, we introduce a generic scheme for constraint propagation in MDDs. We show that all previously known propagation algorithms for MDDs can… (More)
Liquefied Natural Gas (LNG) is steadily becoming a common mode for commercializing natural gas. In this paper, we develop methods for improving both lower and upper bounds for a previously stated form of an LNG inventory routing problem. A Dantzig-Wolfe-based decomposition approach is developed for LNG inventory routing problem (LNG-IRP) attempting to… (More)
This thesis addresses three topics: solving the Nash Equilibrium problem for two-player zero-sum games presented in extensive form, constraint programming using multivalued decision diagrams and scheduling cranes in a factory. In the first chapter, we develop a first-order method based on a smoothing technique of Nesterov that allows us to solve problems… (More)
We describe a heuristic algorithm for scheduling the movement of multiple factory cranes mounted on a common track. The cranes must complete a sequence of tasks at locations along the track without crossing paths, while adhering as closely as possible to a factory production schedule. The algorithm creates a decision tree of possible states of the crane… (More)
Motorists on hospital campuses become pedestrians once they park their cars. How to best plan for hospital pedestrian safety and enforce safer travel conditions for the pedestrian/motorist is the subject of this article by a parking consultant.