Now showing items 11-18 of 18
On the existence of triangles in random key graphs
The random key graph, also known as the uniform random intersection graph, is a random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We show the ...
Aggregating Alphabets to Construct Balanced Words
Balanced words are useful for scheduling mixed-model, just-in-time assembly lines, planning preventive maintenance, managing inventory, and controlling asynchronous transfer mode (ATM) networks. This paper considers the ...
Covering Analysis of Flooding Algorithms on a 1-D Continuum Model
This work presents a covering analysis of pruning algorithms on one dimensional random graphs
Solving the Inventory Slack Routing Problem for Medication Distribution Planning
This paper presents a two-stage approach for solving the inventory slack routing routing problem in order to improve medication distribution planning, which is a critical issue in emergency preparedness. Public health ...
Bat-Inspired Robot Navigation
A key objective of Robotics is the autonomous navigation of mobile robots through an obstacle field. Inspired by echolocating bats, we developed a two-part navigation system consisting of obstacle detection through ...
Convergence results for the linear consensus problem under Markovian random graphs
This note discusses the linear discrete and continuous time consensus problem for a network of dynamic agents with directed information flows and random switching topologies. The switching is determined by a Markov chain, ...
A Short Note on Combining Multiple Policies in Risk-Sensitive Exponential Average Reward Markov Decision Processes
This short note presents a method of combining multiple policies in a given policy set such that the resulting policy improves all policies in the set for risk-sensitive exponential average reward Markov decision processes ...