Skip to main content
Nubint
智能体
资源
价格方案
关于我们
ZH
Home
论文解读
Decision Sciences
Decision Sciences 论文解读
Decision Sciences 领域重要论文的 AI 解读列表,按研究动机、方法与结果结构化呈现。
全部
Computer Science
Mathematics
Physics and Astronomy
Engineering
Materials Science
Chemistry
Chemical Engineering
Earth and Planetary Sciences
Environmental Science
Energy
Biochemistry, Genetics and Molecular Biology
Neuroscience
Immunology and Microbiology
Agricultural and Biological Sciences
Medicine
Pharmacology, Toxicology and Pharmaceutics
Health Professions
Economics, Econometrics and Finance
Business, Management and Accounting
Decision Sciences
Social Sciences
Psychology
Arts and Humanities
Filter
5,756 results
Multi-objective Contextual Multi-armed Bandit Problem with a Dominant Objective.
Cem Tekin, Eralp Turğay
arXiv (Cornell University)
|
2017
|
3 citations
Multi-Player Bandits -- a Musical Chairs Approach
Jonathan Rosenski, Ohad Shamir, +1
arXiv (Cornell University)
|
2015
|
3 citations
Multi-scale turbulence modeling and maximum information principle. Part 1
Limin Tao
arXiv (Cornell University)
|
2010
|
3 citations
Multistep Consistency Models
Jonathan Heek, Emiel Hoogeboom, +1
arXiv (Cornell University)
|
2024
|
3 citations
Multivariate Arrival Times with Recurrent Neural Networks for Personalized Demand Forecasting
Tianle Chen, Brian Keng, +1
arXiv (Cornell University)
|
2018
|
3 citations
Myopic Bayesian Design of Experiments via Posterior Sampling and Probabilistic Programming
Kirthevasan Kandasamy, Willie Neiswanger, +4
arXiv (Cornell University)
|
2018
|
3 citations
Nash Equilbria for Quadratic Voting
Steven P. Lalley, E. Glen Weyl
arXiv (Cornell University)
|
2014
|
3 citations
Near to Mid-term Risks and Opportunities of Open-Source Generative AI
Francisco Eiras, Aleksandar Petrov, +22
arXiv (Cornell University)
|
2024
|
3 citations
Necessity of numerical smoothness
T. Sun
arXiv (Cornell University)
|
2012
|
3 citations
Neural networks for stock price prediction
Yuegang Song, Yulong Zhou, +1
arXiv (Cornell University)
|
2018
|
3 citations
505
506
507
508
509