English
Related papers

Related papers: Estimating the Spatial Reuse with Configuration Mo…

200 papers

In this paper we analyze the performance of single stream and multi-stream spatial multiplexing (SM) systems employing opportunistic scheduling in the presence of interference. In the proposed downlink framework, every active user reports…

Information Theory · Computer Science 2013-07-16 Kiran Kuchi

Consider the problem of a multi-user multiple access channel. While several multi-user coding techniques exist, in practical scenarios, not all users can be scheduled simultaneously. Thus, a key problem is which users to schedule in a given…

Information Theory · Computer Science 2015-07-14 Ori Shmuel , Asaf Cohen , Omer Gurewitz

In cellular networks, users are grouped into different cells and served by different access points (base stations) that provide wireless access to services and applications. In general, the service demand is very heterogeneous,…

Networking and Internet Architecture · Computer Science 2016-11-07 David González G. , Harri Hakula , Antti Rasila , Jyri Hämäläinen

An important approach for efficient inference in probabilistic graphical models exploits symmetries among objects in the domain. Symmetric variables (states) are collapsed into meta-variables (meta-states) and inference algorithms are run…

Artificial Intelligence · Computer Science 2016-07-01 Ankit Anand , Aditya Grover , Mausam , Parag Singla

This article studies the commonsense object affordance concept for enabling close-to-human task planning and task optimization of embodied robotic agents in urban environments. The focus of the object affordance is on reasoning how to…

The utilization of universal frequency reuse in multi-beam satellite systems introduces a non-negligible level of co-channel interference (CCI), which in turn penalizes the quality of service experienced by users. Taking this as starting…

Information Theory · Computer Science 2016-11-15 Vincent Boussemart , Loris Marini , Matteo Berioli

The multiple access scheduling decides how the channel is shared among the nodes in the network. Typical scheduling algorithms aims at increasing the channel utilization and thereby throughput of the network. This paper describes several…

Information Theory · Computer Science 2025-09-30 Vijaya Yajnanarayana , Klas E. G. Magnusson , Rasmus Brandt , Satyam Dwivedi , Peter Händel

In this paper we provide an overview of a new framework for robot perception, real-world modelling, and navigation that uses a stochastic tesselated representation of spatial information called the Occupancy Grid. The Occupancy Grid is a…

Robotics · Computer Science 2013-04-05 A. Elfes

It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic channel and network conditions. However, these algorithms achieve a hypothetical rate region which does not take into account the overhead…

Networking and Internet Architecture · Computer Science 2019-11-12 Mehmet Karaca , Tansu Alpcan , Ozgur Ercetin

We study a general model on reusable resource allocation under model uncertainty. A heterogeneous population of customers arrive at the decision maker's (DM's) platform sequentially. Upon observing a customer's type, the DM selects an…

Optimization and Control · Mathematics 2022-12-07 Xilin Zhang , Wang Chi Cheung

In this paper we present efficient algorithmic solutions for several constrained resource allocation, management and discovery problems. We consider new types of resource allocation models and constraints, and we present new geometric…

Data Structures and Algorithms · Computer Science 2009-06-09 Mugurel Ionut Andreica , Madalina Ecaterina Andreica , Daniel Ardelean

Sampling-based motion planning techniques have emerged as an efficient algorithmic paradigm for solving complex motion planning problems. These approaches use a set of probing samples to construct an implicit graph representation of the…

Robotics · Computer Science 2019-10-10 Brian Ichter , Edward Schmerling , Tsang-Wei Edward Lee , Aleksandra Faust

Landmarks have long played a pivotal role in automated planning, serving as crucial elements for improving the planning algorithms. The main limitation of classical landmark extraction methods is their sensitivity to specific planning…

Artificial Intelligence · Computer Science 2025-09-23 Cristian Pérez-Corral , Antonio Garrido , Laura Sebastia

This letter considers stochastic geometry modelling (SGM) for estimating the signal-to-interference-and-noise ratio (SINR) and throughput of CSMA networks. We show that, despite its compact mathematical formulation, SGM has serious…

Networking and Internet Architecture · Computer Science 2020-06-02 Andra M. Voicu , Ljiljana Simić , Marina Petrova

Random network models, constrained to reproduce specific statistical features, are often used to represent and analyze network data and their mathematical descriptions. Chief among them, the configuration model constrains random networks by…

Social and Information Networks · Computer Science 2025-01-28 Laurent Hébert-Dufresne , Jean-Gabriel Young , Alexander Daniels , Alec Kirkley , Antoine Allard

In this article we focus on dynamic network data which describe interactions among a fixed population through time. We model this data using the latent space framework, in which the probability of a connection forming is expressed as a…

Methodology · Statistics 2021-12-21 Kathryn Turnbull , Christopher Nemeth , Matthew Nunes , Tyler McCormick

This paper introduces a novel spatial interaction model to explore the decision-making processes of a resource allocator and local agents, with central and local governments serving as empirical representations. The model captures two key…

Econometrics · Economics 2025-07-02 Hanbat Jeong

This paper considers a Massive multiple-input multiple-output (MIMO) network, where the base station (BS) with a large number of antennas communicates with a smaller number of users. The signals are transmitted using frequency division…

Information Theory · Computer Science 2018-04-24 Manijeh Bashar , Alister G. Burr , Katsuyuki Haneda Kanapathippillai Cumanan

The effective usages of computational resources are a primary concern of up-to-date distributed applications. In this paper, we present a methodology to reason about resource usages (acquisition, release, revision, ...), and therefore the…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-08-02 Chiara Bodei , Viet Dung Dinh , Gian Luigi Ferrari

Simulation-based problems involving mixed-variable inputs frequently feature domains that are hierarchical, conditional, heterogeneous, or tree-structured. These characteristics pose challenges for data representation, modeling, and…

Machine Learning · Computer Science 2026-01-21 Paul Saves , Edward Hallé-Hannan , Jasper Bussemaker , Youssef Diouane , Nathalie Bartoli