Computing Constrained Shortest-Paths at Scale
Motivated by the needs of modern transportation service platforms, we study the problem of computing constrained shortest paths (CSP) at scale via preprocessing techniques. Our work makes two contr…
Online Allocation and Pricing : Constant Regret via Bellman Inequalities
We develop a framework for designing simple and efficient policies for a family of online allocation and pricing problems that includes online packing, budget-constrained probing, dynamic pricing, …
Hasil Pencarian
Ditemukan 3 dari pencarian Anda melalui kata kunci: Pengarang : Vera, Alberto
Permintaan membutuhkan 0,57285 detik untuk selesai
Karya Umum 
Filsafat 
Agama 
Ilmu-ilmu Sosial 
Bahasa 
Ilmu-ilmu Murni 
Ilmu-ilmu Terapan 
Kesenian, Hiburan, dan Olahraga 
Kesusastraan 
Geografi dan Sejarah