大学 × 全分野
中央大学
全分野 / 2021–2025 確定版
掲載論文 16 本
論文一覧
16 本
このEditionのランキングに掲載している論文です。同じ大学の複数著者による共著は1本にまとめています。
分野をまたぐ同一論文も1本です。総合ポイントは、分野別順位に基づく別の指標です。
2025年
- Quantifying Memory Utilization with Effective State-Size
掲載ID:
pmlr:v267:parnichkun25a - Development of a Cleaning Robot Capable of Self-Propelled Cleaning for Ducts in Real-World Environments Employing a Planetary Gear Mechanism
掲載ID:
doi:10.1109/iros60139.2025.11245996 - Development of a hard matter crushing peristaltic bioreactor inspired by an avian gizzard structure for Fermentation Acceleration
掲載ID:
doi:10.1109/iros60139.2025.11247495 - 3-Majority and 2-Choices with Many Opinions
掲載ID:
doi:10.1145/3732772.3733511 - Asynchronous 3-Majority Dynamics with Many Opinions
掲載ID:
doi:10.1137/1.9781611978322.140
2024年
- New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
掲載ID:
doi:10.1609/aaai.v38i11.29166 - State-Free Inference of State-Space Models: The *Transfer Function* Approach
掲載ID:
pmlr:v235:parnichkun24a - Visual Feedback Control of an Underactuated Hand for Grasping Brittle and Soft Foods
掲載ID:
doi:10.1109/icra57147.2024.10610649 - Development of a peristaltic flexible transfer system for transporting feces under microgravity: Construction and validation of transport models
掲載ID:
doi:10.1109/iros58592.2024.10802587 - Peristaltic Soft Robot for Long-distance Pipe Inspection with an Endoskeletal Structure for Propulsion and Traction Amplification
掲載ID:
doi:10.1109/iros58592.2024.10801920
2023年
- Vision-Based In-Hand Manipulation of Variously Shaped Objects via Contact Point Prediction
掲載ID:
doi:10.1109/iros55552.2023.10341968 - Bandit Task Assignment with Unknown Processing Time
掲載ID:
neurips:2023:1c5ee7343f396954377c2c16dda33a96
2022年
- Online Task Assignment Problems with Reusable Resources
掲載ID:
doi:10.1609/aaai.v36i5.20455
2021年
- Finding Diverse Trees, Paths, and More
掲載ID:
doi:10.1609/aaai.v35i5.16495 - Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions
掲載ID:
doi:10.1609/aaai.v35i11.17177 - How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?
掲載ID:
doi:10.1137/1.9781611976465.8
掲載対象外の論文や未反映の論文は、この一覧には含まれません。