scientific article
From MaRDI portal
Publication:3721805
zbMath0592.68029MaRDI QIDQ3721805
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
concurrency controldynamic channel assignmentproduct-form distributionsdatabase lockingrandom access schemes
Related Items
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region, An insight into dynamic channel assignment in cellular mobile communications systems, Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction, A HC model with countable set of spin values: Uncountable set of Gibbs measures, Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs, On the set of Gibbs measures for model with a countable set of spin values on Cayley trees, Stochastic analysis of dynamic processes, Ergodicity of the hard-core model on \(\mathbb{Z}^ 2\) with parity-dependent activities, Nonmonotonicity of phase transitions in a loss network with controls, Optimal channel allocation for several types of cellular radio networks, Channels in cellular systems: To borrow or not to borrow..., On the average size of independent sets in triangle-free graphs, Correlation decay and the absence of zeros property of partition functions, Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\), On equilibrium analysis of acyclic multiclass loss networks under admission control, Gibbs measures for HC-model with a cuountable set of spin values on a Cayley tree, Revisiting Stochastic Loss Networks: Structures and Approximations, Correlation decay and deterministic FPTAS for counting colorings of a graph, Unnamed Item, Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models, Factor models on locally tree-like graphs, Mathematical theory of queueing networks, On time-triggered and event-based control of integrator systems over a shared communication system, A new multivariate Markov chain model for adding a new categorical data sequence, Asymptotically exact analysis of a loss network with channel continuity, Dismantlability, connectedness, and mixing in relational structures, Transition time asymptotics of queue-based activation protocols in random-access networks, Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model, Algorithms for #BIS-Hard Problems on Expander Graphs, Counting hypergraph matchings up to uniqueness threshold, Windowed backoff algorithms for WiFi: theory and performance under batched arrivals, Extremality of translation-invariant phases for a three-state SOS-model on the binary tree, Blocking and dimer processes on the Cayley tree, Ergodicity of one-dimensional resource sharing systems., Glauber dynamics on trees: Boundary conditions and mixing time, Exponential penalty function control of loss networks, Improved approximations for the Erlang loss model, Phase ordering after a deep quench: the stochastic Ising and hard core gas models on a tree, Gradient Gibbs measures for the SOS model with countable values on a Cayley tree, Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models, On the hardness of sampling independent sets beyond the tree threshold, Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin--Whitt Heavy-Traffic Regime, Threshold phenomena in the transient behaviour of Markovian models of communication networks and databases, Graph homomorphisms and phase transitions, Gibbs measures and dismantlable graphs, Approximate Counting via Correlation Decay in Spin Systems, Uniqueness of Gibbs measures for continuous hardcore models, Stability results for a general class of interacting point processes dynamics, and applications, Sequential cavity method for computing free energy and surface pressure, Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model, Computational complexity of loss networks