In this paper, we propose a Computer Aided Design (CAD) tool so called HiperionCAD, which allows the design and optimization of Time-Division Multiplexing (TDM) and Wavelength-Division Multiplexing (WDM) optical networks. The tool has been developed by means of the Model-Driven Development (MDD) approach. The HiperionCAD software allows the network visual design and the following computations: ...

We investigate computational and mechanism design aspects of optimal scarce resource allocation, where the primary rationing mechanism is through waiting times. Specifically we consider the problem of allocating medical treatments to a population of patients. Each patient has demand for exactly one unit of treatment, and can choose to be treated in one of k hospitals, H1, . . . ,Hk. Different h...

.......................................................................................................................................... 3 Project Proposal ............................................................................................................................. 4 The application...................................................................................................

Department of Systems Engineering and Operations Research George Mason University, Fairfax, VA 22030, USA [email protected] [email protected] Abstract We present a simulation run allocation scheme for improving efficiency in simulation experiments for decision making under uncertainty. This scheme is called Optimal Computing Budget Allocation (OCBA). OCBA advances the state-of-the-art by intelligently ...

We investigate computational and mechanism design aspects of optimal scarce resource allocation, where the primary rationing mechanism is through waiting times. Specifically we consider the problem of allocating medical treatments to a population of patients. Each patient has demand for exactly one unit of treatment, and can choose to be treated in one of k hospitals, H1, . . . ,Hk. Different h...

We study budget constrained network upgradeable problems. We are given an undirected edge weighted graph G = (V,E) where the weight an edge e ∈ E can be upgraded for a cost c(e). Given a budget B for improvement, the goal is to find a subset of edges to be upgraded so that the resulting network is optimum for B. The results obtained in this paper include the following. 1. Maximum Weight Constra...

Sampling is a fundamental problem in both computer science and statistics. A number of issues arise when designing a method based on sampling. These include statistical considerations such as constructing a good sampling design and ensuring there are good, tractable estimators for the quantities of interest as well as computational considerations such as designing fast algorithms for streaming ...

We address the problem of the weights design for consensus algorithms under random network topology. We differ two different cases: 1) high estimate precision is required, and there is no firm restriction on the number of available iterations; 2) there is only a small, limited budget of iterations available. For the first case, we show that minimizing the mean squared error contraction factor i...

The prevalent strategy in the topology optimization phase is to select a subset of members existing in an excessively connected truss, called Ground Structure, such that the overall weight or cost is minimized. Although finding a good topology significantly reduces the overall cost, excessive growth of the size of topology space combined with existence of varied types of design variables challe...

Two novel schemes of selecting the current best solutions for multiobjective differential evolution are proposed in this paper. Based on the search biases strategy suggested by Runarsson and Yao, a hybrid of multiobjective differential evolution and genetic algorithm with (N+N) framework for constrained MOPs is given. And then the hybrid algorithm adopting the two schemes respectively is compar...