Discrete Channel Functional Part Synthesis Problem under Information Criterions
نویسندگان
چکیده
منابع مشابه
Reconfigurability in MDO Problem Synthesis, Part 2
Integrating autonomous disciplines into a problem amenable to solution presents a major challenge in realistic multidisciplinary design optimization (MDO). We propose a linguistic approach to MDO problem description, formulation, and solution we call reconfigurable multidisciplinary synthesis (REMS). With assistance from computer science techniques, REMS comprises an abstract language and a col...
متن کاملScheduling Under Fading and Partial Channel Information
We consider a scheduler for the downlink of a wireless channel when only partial channel-state information is available at the scheduler. We characterize the network stability region and provide two throughputoptimal scheduling policies. We also derive a deterministic bound on the mean packet delay in the network. Finally, we provide a throughputoptimal policy for the network under QoS constrai...
متن کاملLossy Channel Games under Incomplete Information
In this paper we investigate lossy channel games under incomplete information, where two players operate on a finite set of unbounded FIFO channels and one player, representing a system component under consideration operates under incomplete information, while the other player, representing the component’s environment is allowed to lose messages from the channels. We argue that these games are ...
متن کاملANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY
This paper analyzes a controllable discrete-time machine repair problem withL operating machines and two repairmen. The number of working servers can be adjusteddepending on the number of failed machines in the system one at a time at machine's failure orat service completion epochs. Analytical closed-form solutions of the stationary probabilities ofthe number of failed machines in the system a...
متن کاملShortest Path Problem Under Trapezoidal Neutrosophic Information
In this study, we propose an approach to determine the shortest path length between a pair of specified nodes s and t on a network whose edge weights are represented by trapezoidal neutrosophic numbers. Finally, an illustrative example is provided to show the applicability and effectiveness of the proposed approach. Keywords—trapezoidal fuzzy neutrosophic sets; score function; Shortest path pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SPIIRAS Proceedings
سال: 2014
ISSN: 2078-9599,2078-9181
DOI: 10.15622/sp.33.1