arXiv (All)
open access
Multi-Agent Reinforcement Learning for Movable Antenna-aided Cell-Free Massive MIMO Systems
The inherent non-convex minimum-separation constraints introduced by movable antennas present a formidable challenge to the joint optimization of antenna positions and transmission strategies, rendering conventional methods computationally infeasible, particularly in large-scale cell-free massive mu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Deterministic Distributed Linearly Separable Computation via Nested Cyclic Codes#1343700
- Using a MIP Solver as a PDHG-Based MIP Heuristic#925204
- Using a MIP Solver as a PDHG-Based MIP Heuristic#920969
- Has MIMO decoding been proved hard from lattice problems?#971971
- Exact Verification of First-Order Methods via Mixed-Integer Linear Programming#1327208
Record · ID 1218122
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive