Published in: LIPIcs, Volume 277, 12th International Conference on Geographic Information Science (GIScience 2023)
Jing Yao, Ziqi Li, Xiaoxiang Zhang, Changjun Liu, and Liliang Ren. A Comparison of Global and Local Statistical and Machine Learning Techniques in Estimating Flash Flood Susceptibility (Short Paper). In 12th International Conference on Geographic Information Science (GIScience 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 277, pp. 86:1-86:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{yao_et_al:LIPIcs.GIScience.2023.86, author = {Yao, Jing and Li, Ziqi and Zhang, Xiaoxiang and Liu, Changjun and Ren, Liliang}, title = {{A Comparison of Global and Local Statistical and Machine Learning Techniques in Estimating Flash Flood Susceptibility}}, booktitle = {12th International Conference on Geographic Information Science (GIScience 2023)}, pages = {86:1--86:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-288-4}, ISSN = {1868-8969}, year = {2023}, volume = {277}, editor = {Beecham, Roger and Long, Jed A. and Smith, Dianna and Zhao, Qunshan and Wise, Sarah}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2023.86}, URN = {urn:nbn:de:0030-drops-189815}, doi = {10.4230/LIPIcs.GIScience.2023.86}, annote = {Keywords: Machine Learning, Spatial Statistics, Flash floods, Susceptibility} }
Published in: LIPIcs, Volume 262, 35th Euromicro Conference on Real-Time Systems (ECRTS 2023)
Ashikahmed Bhuiyan, Mohammad Pivezhandi, Zhishan Guo, Jing Li, Venkata Prashant Modekurthy, and Abusayeed Saifullah. Precise Scheduling of DAG Tasks with Dynamic Power Management. In 35th Euromicro Conference on Real-Time Systems (ECRTS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 262, pp. 8:1-8:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{bhuiyan_et_al:LIPIcs.ECRTS.2023.8, author = {Bhuiyan, Ashikahmed and Pivezhandi, Mohammad and Guo, Zhishan and Li, Jing and Modekurthy, Venkata Prashant and Saifullah, Abusayeed}, title = {{Precise Scheduling of DAG Tasks with Dynamic Power Management}}, booktitle = {35th Euromicro Conference on Real-Time Systems (ECRTS 2023)}, pages = {8:1--8:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-280-8}, ISSN = {1868-8969}, year = {2023}, volume = {262}, editor = {Papadopoulos, Alessandro V.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2023.8}, URN = {urn:nbn:de:0030-drops-180372}, doi = {10.4230/LIPIcs.ECRTS.2023.8}, annote = {Keywords: Parallel task, mixed-criticality scheduling, energy minimization, dynamic power management, cluster-based platform} }
Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Lior Ben Yamin, Jing Li, Kanthi Sarpatwar, Baruch Schieber, and Hadas Shachnai. Maximizing Throughput in Flow Shop Real-Time Scheduling. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 48:1-48:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{benyamin_et_al:LIPIcs.APPROX/RANDOM.2020.48, author = {Ben Yamin, Lior and Li, Jing and Sarpatwar, Kanthi and Schieber, Baruch and Shachnai, Hadas}, title = {{Maximizing Throughput in Flow Shop Real-Time Scheduling}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {48:1--48:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Byrka, Jaros{\l}aw and Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.48}, URN = {urn:nbn:de:0030-drops-126510}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.48}, annote = {Keywords: Flow shop, real-time scheduling, throughput maximization, approximation algorithms} }
Published in: LITES, Volume 6, Issue 1 (2019). Leibniz Transactions on Embedded Systems, Volume 6, Issue 1
James Orr, Chris Gill, Kunal Agrawal, Jing Li, and Sanjoy Baruah. Elastic Scheduling for Parallel Real-Time Systems. In LITES, Volume 6, Issue 1 (2019). Leibniz Transactions on Embedded Systems, Volume 6, Issue 1, pp. 05:1-05:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Article{orr_et_al:LITES-v006-i001-a005, author = {Orr, James and Gill, Chris and Agrawal, Kunal and Li, Jing and Baruah, Sanjoy}, title = {{Elastic Scheduling for Parallel Real-Time Systems}}, journal = {Leibniz Transactions on Embedded Systems}, pages = {05:1--05:14}, ISSN = {2199-2002}, year = {2019}, volume = {6}, number = {1}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LITES-v006-i001-a005}, doi = {10.4230/LITES-v006-i001-a005}, annote = {Keywords: Parallel real-time tasks, multiprocessor federated scheduling, elasticity coefficient} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Jing Chen, Bo Li, Yingkai Li, and Pinyan Lu. Brief Announcement: Bayesian Auctions with Efficient Queries. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 108:1-108:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chen_et_al:LIPIcs.ICALP.2018.108, author = {Chen, Jing and Li, Bo and Li, Yingkai and Lu, Pinyan}, title = {{Brief Announcement: Bayesian Auctions with Efficient Queries}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {108:1--108:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.108}, URN = {urn:nbn:de:0030-drops-91124}, doi = {10.4230/LIPIcs.ICALP.2018.108}, annote = {Keywords: The complexity of Bayesian mechanisms, quantile queries, value queries} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Jing Chen, Bo Li, and Yingkai Li. Efficient Approximations for the Online Dispersion Problem. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{chen_et_al:LIPIcs.ICALP.2017.11, author = {Chen, Jing and Li, Bo and Li, Yingkai}, title = {{Efficient Approximations for the Online Dispersion Problem}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.11}, URN = {urn:nbn:de:0030-drops-74002}, doi = {10.4230/LIPIcs.ICALP.2017.11}, annote = {Keywords: dispersion, online algorithms, geometric optimization, packing, competitive algorithms} }
Feedback for Dagstuhl Publishing