Cover Image

Design and Implementation of Smart Infrastructures and Connected Vehicles in A Mini-city Platform

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Vargas, Daniel, Haque, Ethan, Carroll, Matthew, Perez, Daniel, Roman, Tyler, Nguyen, Phong, Habibi, Golnaz
Format:	Preprint
Published:	2024
Subjects:	Robotics 68F00 (Primary), 68F11 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Algorithm and abstraction in formal mathematics
by: Macbeth, Heather
Published: (2024)

Folding the Heighway dragon curve
by: Chang, Ting-Wu, et al.
Published: (2026)

A novel approach to data generation in generative model
by: Kim, JaeHong, et al.
Published: (2025)

Style Transfer with Diffusion Models for Synthetic-to-Real Domain Adaptation
by: Chigot, Estelle, et al.
Published: (2025)

Computational Complexity of Determining the Assembly Index
by: Masierak, Piotr
Published: (2026)

Central limit theorems for additive functionals in patricia tries
by: Ischebeck, Jasper
Published: (2023)

Extracting and Validating Explanatory Word Archipelagoes using Dual Entropy
by: Ohsawa, Yukio
Published: (2020)

$Δ$-Nets: Interaction-Based System for Optimal Parallel $λ$-Reduction
by: Salvadori, Daniel Augusto Rizzi
Published: (2025)

Normal forms in Virus Machines
by: Ramírez-de-Arellano, A., et al.
Published: (2024)

Quantum Search without Global Diffusion
by: Burke, John, et al.
Published: (2026)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
by: Dorochko, Leonid, et al.
Published: (2026)

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
by: Bruse, Florian, et al.
Published: (2026)

Provability in BI's Sequent Calculus is Decidable
by: Gheorghiu, Alexander, et al.
Published: (2021)

Learning to Repair Lean Proofs from Compiler Feedback
by: Wang, Evan, et al.
Published: (2026)

Quantum Algorithms for the Minimum Steiner Tree problem with application to Binary Near-Perfect Phylogenies
by: Meng, Lingfa, et al.
Published: (2025)

An Alternative Approach to Formal Mathematics that Focuses on Communication and Accessibility
by: Farmer, William M.
Published: (2026)

Why the classes P and NP are not well-defined finitarily
by: Anand, Bhupinder Singh
Published: (2024)

Proof complexity of universal algebra in a CSP dichotomy proof
by: Gaysin, Azza
Published: (2024)

A novel approach to the relationships between data features -- based on comprehensive examination of mathematical, technological, and causal methodology
by: Kim, JaeHong
Published: (2025)

Hive is PSPACE-Hard
by: Andel, Daniël, et al.
Published: (2025)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2023)

Deterministic Quantum Search via Recursive Oracle Expansion
by: Burke, John, et al.
Published: (2025)

Leakage-Resilient Hardness Equivalence to Logspace Derandomization
by: Shalunov, Yakov
Published: (2023)

TableMoE: Neuro-Symbolic Routing for Structured Expert Reasoning in Multimodal Table Understanding
by: Zhang, Junwen, et al.
Published: (2025)

Rewriting in Artin groups without A_3 or B_3 subdiagrams
by: Blasco-García, Rubén, et al.
Published: (2024)

The Word Problem is Solvable for 3-free Artin groups in Quadratic Time
by: Blasco-García, Rubén, et al.
Published: (2022)

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)

Verification of Quantum Protocols Adopting Physically Admissible Schedulers
by: Ceragioli, Lorenzo, et al.
Published: (2026)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
by: Nakano, Keisuke, et al.
Published: (2024)

Topological Logics with Connectedness over Euclidean Spaces
by: Kontchakov, Roman, et al.
Published: (2011)

An SoS Entropy Dichotomy via Windowed Hypercontractivity
by: Lela, Marko
Published: (2025)

A $5/4$-Approximation for Two-Edge Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2024)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
by: Sølvsten, Steffan Christ, et al.
Published: (2023)

A Characterization of Complexity in Public Goods Games
by: Gilboa, Matan
Published: (2023)

Sample completion, structured correlation, and Netflix problems
by: Coregliano, Leonardo N., et al.
Published: (2025)

Large Spikes in Stochastic Gradient Descent: A Large-Deviations View
by: Gess, Benjamin, et al.
Published: (2026)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
by: Opris, Andre
Published: (2025)

Emulation-Completeness of Programming Languages
by: Morse, Gregory, et al.
Published: (2026)

Quantum NLP models on Natural Language Inference
by: Sun, Ling, et al.
Published: (2025)