Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons™

Open Access. Powered by Scholars. Published by Universities.®

2007

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 301 - 304 of 304

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Modeling Network Traffic On A Global Network-Centric System With Artificial Neural Networks, Douglas K. Swift Jan 2007

Modeling Network Traffic On A Global Network-Centric System With Artificial Neural Networks, Douglas K. Swift

Doctoral Dissertations

"This dissertation proposes a new methodology for modeling and predicting network traffic. It features an adaptive architecture based on artificial neural networks and is especially suited for large-scale, global, network-centric systems. Accurate characterization and prediction of network traffic is essential for network resource sizing and real-time network traffic management. As networks continue to increase in size and complexity, the task has become increasingly difficult and current methodology is not sufficiently adaptable or scaleable. Current methods model network traffic with express mathematical equations which are not easily maintained or adjusted. The accuracy of these models is based on detailed characterization of …

Go to article

Iterated Weaker-Than-Weak Dominance, Shih-Fen Cheng, Michael P. Wellman Jan 2007

Iterated Weaker-Than-Weak Dominance, Shih-Fen Cheng, Michael P. Wellman

Research Collection School Of Computing and Information Systems

We introduce a weakening of standard gametheoretic δ-dominance conditions, called dominance, which enables more aggressive pruning of candidate strategies at the cost of solution accuracy. Equilibria of a game obtained by eliminating a δ-dominated strategy are guaranteed to be approximate equilibria of the original game, with degree of approximation bounded by the dominance parameter. We can apply elimination of δ-dominated strategies iteratively, but the for which a strategy may be eliminated depends on prior eliminations. We discuss implications of this order independence, and propose greedy heuristics for determining a sequence of eliminations to reduce the game as far as possible …

Go to article

Towards Efficient Computation Of Quality Bounded Solutions In Pomdps: Expected Value Approximation And Dynamic Disjunctive Beliefs, Pradeep Reddy Varakantham, Rajiv Maheswaran, Tapana Gupta, Milind Tambe Jan 2007

Towards Efficient Computation Of Quality Bounded Solutions In Pomdps: Expected Value Approximation And Dynamic Disjunctive Beliefs, Pradeep Reddy Varakantham, Rajiv Maheswaran, Tapana Gupta, Milind Tambe

Research Collection School Of Computing and Information Systems

While POMDPs (partially observable markov decision problems) are a popular computational model with wide-ranging applications, the computational cost for optimal policy generation is prohibitive. Researchers are investigating ever-more efficient algorithms, yet many applications demand such algorithms bound any loss in policy quality when chasing efficiency. To address this challenge, we present two new techniques. The first approximates in the value space to obtain solutions efficiently for a pre-specified error bound. Unlike existing techniques, our technique guarantees the resulting policy will meet this bound. Furthermore, it does not require costly computations to determine the quality loss of the policy. Our second …

Go to article

Methodology For Analyzing And Characterizing Error Generation In Presence Of Autocorrelated Demands In Stochastic Inventory Models, Rafael Diaz Jan 2007

Methodology For Analyzing And Characterizing Error Generation In Presence Of Autocorrelated Demands In Stochastic Inventory Models, Rafael Diaz

Computational Modeling & Simulation Engineering Theses & Dissertations

Most techniques that describe and solve stochastic inventory problems rely upon the assumption of identically and independently distributed (IID) demands. Stochastic inventory formulations that fail to capture serially-correlated components in the demand lead to serious errors. This dissertation provides a robust method that approximates solutions to the stochastic inventory problem where the control review system is continuous, the demand contains autocorrelated components, and the lost sales case is considered. A simulation optimization technique based on simulated annealing (SA), pattern search (PS), and ranking and selection (R&S) is developed and used to generate near-optimal solutions. The proposed method accounts for the …

Go to article

First Prev