Prioritized Random MAC Optimization Via Graph-Based Analysis
نویسندگان
چکیده
منابع مشابه
Decoding linear codes via optimization and graph-based techniques
OF THE DISSERTATION Decoding Linear Codes via Optimization and Graph-Based TechniquesbyMohammad H. TaghaviDoctor of Philosophy in Electrical Engineering(Communications Theory and Systems)University of California San Diego, 2008Professor Paul H. Siegel, Chair Low-density parity-check (LDPC) codes have made it possible to communicate at in-formation rates very close to...
متن کاملApproximate counting via random optimization
4 ABSTRACT: Let F be a family of subsets of 1, . . . , n . We propose a simple randomized n algorithm to estimate the cardinality of F from the maximum weight of a subset XgF in n n 4 a random weighting of 1, . . . , n . The examples include enumeration of perfect matchings in graphs, bases in matroids, and Hamiltonian cycles in graphs. Q 1997 John Wiley & Sons, Inc. Ž . Random Struct. Alg., 11...
متن کاملRandom Sampling in Graph Optimization Problems
The representative random sample is a central concept of statistics. It is often possible to gather a great deal of information about a large population by examining a small sample randomly drawn from it. This approach has obvious advantages in reducing the investigator's work, both in gathering and in analyzing the data. We apply the concept of a representative sample to combinatorial optimiza...
متن کاملGraph Model Selection via Random Walks
In this paper, we present a novel approach based on the random walk process for finding meaningful representations of a graph model. Our approach leverages the transient behavior of many short random walks with novel initialization mechanisms to generate model discriminative features. These features are able to capture a more comprehensive structural signature of the underlying graph model. The...
متن کاملPrioritized-LRTA*: Speeding Up Learning via Prioritized Updates
Modern computer games demand real-time simultaneous control of multiple agents. Learning real-time search, which interleaves planning and acting, allows agents to both learn from experience and respond quickly. Such algorithms require no prior knowledge of the environment and can be deployed without pre-processing. We introduce PrioritizedLRTA*, an algorithm based on Prioritized Sweeping. This ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2015
ISSN: 0090-6778
DOI: 10.1109/tcomm.2015.2494044