본문

  1. Home
  4. 학위논문
71 Results:SS:DECISION PP:STANFORD UNIVERSITY. 0.500 sec.
RSS 
다국어입력
 상세검색
 신착검색
선택출력 선택엑셀내보내기
11
Efficient and Reconfigurable Approximate Value Functions for Task Scheduling, Path Planning, and Control.
Efficient and Reconfigurable Approximate Value Functions for Task Scheduling, Path Planning, and Control.
Washington, Patrick Henry. | Stanford University. | 2024
프린트
12
A Decision-Making Model for Retired Li-Ion Batteries.
A Decision-Making Model for Retired Li-Ion Batteries.
Zhuang, Jihan. | Stanford University. | 2024
프린트
13
Culturally Responsive Advising: A New Avenue for Supporting Chinese International and Chinese American Students.
Culturally Responsive Advising: A New Avenue for Supporting Chinese International and Chinese American Students.
Schell, Emily Petruzzelli. | Stanford University. | 2024
프린트
14
The Nonparametric Probabilistic Method for Model-Form Uncertainty Quantification, Model Updating and Digital Twinning.
The Nonparametric Probabilistic Method for Model-Form Uncertainty Quantification, Model Updating and Digital Twinning.
Azzi, Marie Jose. | Stanford University. | 2024
프린트
15
Designing Prediction and Recommendation Algorithms to Improve Human Decision-Making.
Designing Prediction and Recommendation Algorithms to Improve Human Decision-Making.
McLaughlin, Bryce. | Stanford University. | 2024
프린트
16
Planning Under Uncertainty in Safety-Critical Systems.
Planning Under Uncertainty in Safety-Critical Systems.
Jamgochian, Arec Levon. | Stanford University. | 2024
프린트
17
Essays on Information Transmission.
Essays on Information Transmission.
Aybas, Yunus Can. | Stanford University. | 2024
프린트
18
Learning-Enabled Adaptation and Planning for Space Robotics.
Learning-Enabled Adaptation and Planning for Space Robotics.
Banerjee, Somrita. | Stanford University. | 2024
프린트
19
Rethinking Uncertainty Quantification for Contextual Bandits.
Rethinking Uncertainty Quantification for Contextual Bandits.
Krishnamurthy, Sanath Kumar. | Stanford University. | 2024
프린트
20
Simplifying Matching Problems Through Optimization Driven Algorithms.
Simplifying Matching Problems Through Optimization Driven Algorithms.
YahyazadehJeloudar, Mobin. | Stanford University. | 2024
프린트
처음이전12345678이후마지막