{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/scheduling/papers/5","list_of":"/task/scheduling","task":"Scheduling","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":5,"pages_in_order":32,"rows_per_page":100,"rows":[401,500],"of":3104,"counts":{"archive_papers_tagged":3104,"with_a_code_link":574,"where_syntology_ran_a_sample":107,"not_listed_spam_title":0,"listed":3104,"listed_where_code_ran":107,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":94,"every_run_a_failure_of_syntologys_instrument":13,"listed_with_a_run_with_no_instrument_failure":94,"listed_every_run_a_failure_of_syntologys_instrument":13,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/scheduling","prev":"/task/scheduling/papers/4","next":"/task/scheduling/papers/6","papers":[{"url":"/paper/average-peak-age-of-information-in-underwater","slug":"average-peak-age-of-information-in-underwater","title":"Average Peak Age of Information in Underwater Information Collection With Sleep-Scheduling","date":"2022-05-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/metanet-automated-dynamic-selection-of","slug":"metanet-automated-dynamic-selection-of","title":"MetaNet: Automated Dynamic Selection of Scheduling Policies in Cloud Environments","date":"2022-05-21","arxiv_id":"2205.10642","repositories_listed":1,"syntology":null},{"url":"/paper/problem-decomposition-and-multi-shot-asp","slug":"problem-decomposition-and-multi-shot-asp","title":"Decomposition Strategies and Multi-shot ASP Solving for Job-shop Scheduling","date":"2022-05-16","arxiv_id":"2205.07537","repositories_listed":1,"syntology":null},{"url":"/paper/bminf-an-efficient-toolkit-for-big-model","slug":"bminf-an-efficient-toolkit-for-big-model","title":"BMInf: An Efficient Toolkit for Big Model Inference and Tuning","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scheduling-virtual-conferences-fairly","slug":"scheduling-virtual-conferences-fairly","title":"Scheduling Virtual Conferences Fairly: Achieving Equitable Participant and Speaker Satisfaction","date":"2022-04-26","arxiv_id":"2204.12062","repositories_listed":1,"syntology":null},{"url":"/paper/map-elites-based-hyper-heuristic-for-the","slug":"map-elites-based-hyper-heuristic-for-the","title":"MAP-Elites based Hyper-Heuristic for the Resource Constrained Project Scheduling Problem","date":"2022-04-24","arxiv_id":"2204.11162","repositories_listed":1,"syntology":null},{"url":"/paper/unigdd-a-unified-generative-framework-for","slug":"unigdd-a-unified-generative-framework-for","title":"UniGDD: A Unified Generative Framework for Goal-Oriented Document-Grounded Dialogue","date":"2022-04-16","arxiv_id":"2204.07770","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unigdd-a-unified-generative-framework-for#ran","syntology_url":"https://syntology.ai/paper/2204.07770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07770"}},"official":{"repos":["gao-xiao-bai/UniGDD"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/forecasting-sql-query-cost-at-twitter","slug":"forecasting-sql-query-cost-at-twitter","title":"Forecasting SQL Query Cost at Twitter","date":"2022-04-12","arxiv_id":"2204.05529","repositories_listed":1,"syntology":null},{"url":"/paper/s-dabt-schedule-and-dependency-aware-bug","slug":"s-dabt-schedule-and-dependency-aware-bug","title":"S-DABT: Schedule and Dependency-Aware Bug Triage in Open-Source Bug Tracking Systems","date":"2022-04-12","arxiv_id":"2204.05972","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-link-sparsification-for-scalable","slug":"distributed-link-sparsification-for-scalable","title":"Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks","date":"2022-03-27","arxiv_id":"2203.14339","repositories_listed":1,"syntology":null},{"url":"/paper/koopman-based-differentiable-predictive","slug":"koopman-based-differentiable-predictive","title":"Koopman-based Differentiable Predictive Control for the Dynamics-Aware Economic Dispatch Problem","date":"2022-03-16","arxiv_id":"2203.08984","repositories_listed":1,"syntology":null},{"url":"/paper/depts-deep-expansion-learning-for-periodic-1","slug":"depts-deep-expansion-learning-for-periodic-1","title":"DEPTS: Deep Expansion Learning for Periodic Time Series Forecasting","date":"2022-03-15","arxiv_id":"2203.07681","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-verification-of-gnn-based-job","slug":"scalable-verification-of-gnn-based-job","title":"Scalable Verification of GNN-based Job Schedulers","date":"2022-03-07","arxiv_id":"2203.03153","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-scheduling-of-university","slug":"evolutionary-scheduling-of-university","title":"Evolutionary scheduling of university activities based on consumption forecasts to minimise electricity costs","date":"2022-02-25","arxiv_id":"2202.12595","repositories_listed":1,"syntology":null},{"url":"/paper/adeada-adaptive-density-aware-active-domain","slug":"adeada-adaptive-density-aware-active-domain","title":"D2ADA: Dynamic Density-aware Active Domain Adaptation for Semantic Segmentation","date":"2022-02-14","arxiv_id":"2202.06484","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adeada-adaptive-density-aware-active-domain#ran","syntology_url":"https://syntology.ai/paper/2202.06484","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06484"}},"official":{"repos":["tsunghan-wu/d2ada"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-compositional-adversarial-robustness","slug":"towards-compositional-adversarial-robustness","title":"Towards Compositional Adversarial Robustness: Generalizing Adversarial Training to Composite Semantic Perturbations","date":"2022-02-09","arxiv_id":"2202.04235","repositories_listed":1,"syntology":null},{"url":"/paper/graph-coloring-with-physics-inspired-graph","slug":"graph-coloring-with-physics-inspired-graph","title":"Graph Coloring with Physics-Inspired Graph Neural Networks","date":"2022-02-03","arxiv_id":"2202.01606","repositories_listed":1,"syntology":null},{"url":"/paper/flipping-the-switch-on-local-exploration","slug":"flipping-the-switch-on-local-exploration","title":"Flipping the switch on local exploration: Genetic Algorithms with Reversals","date":"2022-02-02","arxiv_id":"2202.00912","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-up-knowledge-graph-creation-to-large","slug":"scaling-up-knowledge-graph-creation-to-large","title":"Scaling Up Knowledge Graph Creation to Large and Heterogeneous Data Sources","date":"2022-01-24","arxiv_id":"2201.09694","repositories_listed":1,"syntology":null},{"url":"/paper/deep-q-learning-a-robust-control-approach","slug":"deep-q-learning-a-robust-control-approach","title":"Deep Q-learning: a robust control approach","date":"2022-01-21","arxiv_id":"2201.08610","repositories_listed":1,"syntology":null},{"url":"/paper/reusing-auto-schedules-for-efficient-dnn","slug":"reusing-auto-schedules-for-efficient-dnn","title":"Transfer-Tuning: Reusing Auto-Schedules for Efficient Tensor Program Code Generation","date":"2022-01-14","arxiv_id":"2201.05587","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/reusing-auto-schedules-for-efficient-dnn#ran","syntology_url":"https://syntology.ai/paper/2201.05587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.05587"}},"official":{"repos":["giclab/transfer-tuning"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-identify-top-elo-ratings-a","slug":"learning-to-identify-top-elo-ratings-a","title":"Learning to Identify Top Elo Ratings: A Dueling Bandits Approach","date":"2022-01-12","arxiv_id":"2201.04480","repositories_listed":1,"syntology":null},{"url":"/paper/conditional-approximate-normalizing-flows-for","slug":"conditional-approximate-normalizing-flows-for","title":"Conditional Approximate Normalizing Flows for Joint Multi-Step Probabilistic Forecasting with Application to Electricity Demand","date":"2022-01-08","arxiv_id":"2201.02753","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-gpu-energy-optimization-for-machine","slug":"dynamic-gpu-energy-optimization-for-machine","title":"Dynamic GPU Energy Optimization for Machine Learning Training Workloads","date":"2022-01-05","arxiv_id":"2201.01684","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-intelligence-for-dynamic-job-shop","slug":"hybrid-intelligence-for-dynamic-job-shop","title":"Hybrid intelligence for dynamic job-shop scheduling with deep reinforcement learning and attention mechanism","date":"2022-01-03","arxiv_id":"2201.00548","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-combinatorial-optimization-model","slug":"an-efficient-combinatorial-optimization-model","title":"An Efficient Combinatorial Optimization Model Using Learning-to-Rank Distillation","date":"2021-12-24","arxiv_id":"2201.00695","repositories_listed":1,"syntology":null},{"url":"/paper/colo-ran-developing-machine-learning-based","slug":"colo-ran-developing-machine-learning-based","title":"ColO-RAN: Developing Machine Learning-based xApps for Open RAN Closed-loop Control on Programmable Experimental Platforms","date":"2021-12-17","arxiv_id":"2112.09559","repositories_listed":1,"syntology":null},{"url":"/paper/gosh-task-scheduling-using-deep-surrogate","slug":"gosh-task-scheduling-using-deep-surrogate","title":"GOSH: Task Scheduling Using Deep Surrogate Models in Fog Computing Environments","date":"2021-12-16","arxiv_id":"2112.08916","repositories_listed":1,"syntology":null},{"url":"/paper/mcds-ai-augmented-workflow-scheduling-in","slug":"mcds-ai-augmented-workflow-scheduling-in","title":"MCDS: AI Augmented Workflow Scheduling in Mobile Edge Cloud Computing Systems","date":"2021-12-14","arxiv_id":"2112.07269","repositories_listed":1,"syntology":null},{"url":"/paper/scheduling-servers-with-stochastic-bilinear","slug":"scheduling-servers-with-stochastic-bilinear","title":"Scheduling Servers with Stochastic Bilinear Rewards","date":"2021-12-13","arxiv_id":"2112.06362","repositories_listed":1,"syntology":null},{"url":"/paper/elegantrl-podracer-scalable-and-elastic","slug":"elegantrl-podracer-scalable-and-elastic","title":"ElegantRL-Podracer: Scalable and Elastic Library for Cloud-Native Deep Reinforcement Learning","date":"2021-12-11","arxiv_id":"2112.05923","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/elegantrl-podracer-scalable-and-elastic#ran","syntology_url":"https://syntology.ai/paper/2112.05923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.05923"}},"official":{"repos":["ai4finance-foundation/elegantrl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-adaptive-distributed-training-on","slug":"end-to-end-adaptive-distributed-training-on","title":"End-to-end Adaptive Distributed Training on PaddlePaddle","date":"2021-12-06","arxiv_id":"2112.02752","repositories_listed":1,"syntology":null},{"url":"/paper/fleetx","slug":"fleetx","title":"FleetX","date":"2021-12-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/optimal-activity-and-battery-scheduling","slug":"optimal-activity-and-battery-scheduling","title":"Optimal activity and battery scheduling algorithm using load and solar generation forecast","date":"2021-12-06","arxiv_id":"2112.02827","repositories_listed":1,"syntology":null},{"url":"/paper/episodic-policy-gradient-training","slug":"episodic-policy-gradient-training","title":"Episodic Policy Gradient Training","date":"2021-12-03","arxiv_id":"2112.01853","repositories_listed":1,"syntology":null},{"url":"/paper/state-of-charge-aware-ev-charging","slug":"state-of-charge-aware-ev-charging","title":"State-of-Charge Aware EV Charging","date":"2021-11-30","arxiv_id":"2111.15147","repositories_listed":1,"syntology":null},{"url":"/paper/doing-more-by-doing-less-how-structured","slug":"doing-more-by-doing-less-how-structured","title":"Doing More by Doing Less: How Structured Partial Backpropagation Improves Deep Learning Clusters","date":"2021-11-20","arxiv_id":"2111.10672","repositories_listed":1,"syntology":null},{"url":"/paper/heterps-distributed-deep-learning-with","slug":"heterps-distributed-deep-learning-with","title":"HeterPS: Distributed Deep Learning With Reinforcement Learning Based Scheduling in Heterogeneous Environments","date":"2021-11-20","arxiv_id":"2111.10635","repositories_listed":1,"syntology":null},{"url":"/paper/on-effective-scheduling-of-model-based","slug":"on-effective-scheduling-of-model-based","title":"On Effective Scheduling of Model-based Reinforcement Learning","date":"2021-11-16","arxiv_id":"2111.08550","repositories_listed":1,"syntology":null},{"url":"/paper/delay-oriented-distributed-scheduling-using","slug":"delay-oriented-distributed-scheduling-using","title":"Delay-Oriented Distributed Scheduling Using Graph Neural Networks","date":"2021-11-13","arxiv_id":"2111.07017","repositories_listed":1,"syntology":null},{"url":"/paper/deep-reinforcement-model-selection-for","slug":"deep-reinforcement-model-selection-for","title":"Deep Reinforcement Model Selection for Communications Resource Allocation in On-Site Medical Care","date":"2021-11-12","arxiv_id":"2111.06680","repositories_listed":1,"syntology":null},{"url":"/paper/learning-data-augmentation-schedules-for","slug":"learning-data-augmentation-schedules-for","title":"Learning Data Augmentation Schedules for Natural Language Processing","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mcunetv2-memory-efficient-patch-based","slug":"mcunetv2-memory-efficient-patch-based","title":"MCUNetV2: Memory-Efficient Patch-based Inference for Tiny Deep Learning","date":"2021-10-28","arxiv_id":"2110.15352","repositories_listed":1,"syntology":null},{"url":"/paper/smore-knowledge-graph-completion-and-multi","slug":"smore-knowledge-graph-completion-and-multi","title":"SMORE: Knowledge Graph Completion and Multi-hop Reasoning in Massive Knowledge Graphs","date":"2021-10-28","arxiv_id":"2110.14890","repositories_listed":1,"syntology":null},{"url":"/paper/an-actor-critic-algorithm-with-deep-double","slug":"an-actor-critic-algorithm-with-deep-double","title":"An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents","date":"2021-10-18","arxiv_id":"2110.09076","repositories_listed":1,"syntology":null},{"url":"/paper/hydra-a-system-for-large-multi-model-deep","slug":"hydra-a-system-for-large-multi-model-deep","title":"Hydra: A System for Large Multi-Model Deep Learning","date":"2021-10-16","arxiv_id":"2110.08633","repositories_listed":1,"syntology":null},{"url":"/paper/solving-large-break-minimization-problems-in","slug":"solving-large-break-minimization-problems-in","title":"Solving Large Break Minimization Problems in a Mirrored Double Round-robin Tournament Using Quantum Annealing","date":"2021-10-14","arxiv_id":"2110.07239","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-elastic-training-for-sparse-deep","slug":"adaptive-elastic-training-for-sparse-deep","title":"Adaptive Elastic Training for Sparse Deep Learning on Heterogeneous Multi-GPU Servers","date":"2021-10-13","arxiv_id":"2110.07029","repositories_listed":1,"syntology":null},{"url":"/paper/hunter-ai-based-holistic-resource-management","slug":"hunter-ai-based-holistic-resource-management","title":"HUNTER: AI based Holistic Resource Management for Sustainable Cloud Computing","date":"2021-10-11","arxiv_id":"2110.05529","repositories_listed":1,"syntology":null},{"url":"/paper/wireless-link-scheduling-via-graph","slug":"wireless-link-scheduling-via-graph","title":"Wireless Link Scheduling via Graph Representation Learning: A Comparative Study of Different Supervision Levels","date":"2021-10-04","arxiv_id":"2110.01722","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-markov-decision-process-in-the","slug":"learning-the-markov-decision-process-in-the","title":"Learning the Markov Decision Process in the Sparse Gaussian Elimination","date":"2021-09-30","arxiv_id":"2109.14929","repositories_listed":1,"syntology":null},{"url":"/paper/data-sharing-and-compression-for-cooperative","slug":"data-sharing-and-compression-for-cooperative","title":"Data Sharing and Compression for Cooperative Networked Control","date":"2021-09-29","arxiv_id":"2109.14675","repositories_listed":1,"syntology":null},{"url":"/paper/nice-robust-scheduling-through-reinforcement","slug":"nice-robust-scheduling-through-reinforcement","title":"NICE: Robust Scheduling through Reinforcement Learning-Guided Integer Programming","date":"2021-09-24","arxiv_id":"2109.12171","repositories_listed":1,"syntology":null},{"url":"/paper/link-scheduling-using-graph-neural-networks","slug":"link-scheduling-using-graph-neural-networks","title":"Link Scheduling using Graph Neural Networks","date":"2021-09-12","arxiv_id":"2109.05536","repositories_listed":1,"syntology":null},{"url":"/paper/characterization-and-prediction-of-deep","slug":"characterization-and-prediction-of-deep","title":"Characterization and Prediction of Deep Learning Workloads in Large-Scale GPU Datacenters","date":"2021-09-03","arxiv_id":"2109.01313","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-based-condition","slug":"reinforcement-learning-based-condition","title":"Reinforcement Learning based Condition-oriented Maintenance Scheduling for Flow Line Systems","date":"2021-08-27","arxiv_id":"2108.12298","repositories_listed":1,"syntology":null},{"url":"/paper/one-shot-transfer-learning-for-population","slug":"one-shot-transfer-learning-for-population","title":"One-shot Transfer Learning for Population Mapping","date":"2021-08-13","arxiv_id":"2108.06228","repositories_listed":1,"syntology":null},{"url":"/paper/chimera-efficiently-training-large-scale","slug":"chimera-efficiently-training-large-scale","title":"Chimera: Efficiently Training Large-Scale Neural Networks with Bidirectional Pipelines","date":"2021-07-14","arxiv_id":"2107.06925","repositories_listed":1,"syntology":null},{"url":"/paper/automated-learning-rate-scheduler-for-large","slug":"automated-learning-rate-scheduler-for-large","title":"Automated Learning Rate Scheduler for Large-batch Training","date":"2021-07-13","arxiv_id":"2107.05855","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/automated-learning-rate-scheduler-for-large#ran","syntology_url":"https://syntology.ai/paper/2107.05855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05855"}},"official":{"repos":["kakaobrain/autowu"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distributed-online-service-coordination-using","slug":"distributed-online-service-coordination-using","title":"Distributed Online Service Coordination Using Deep Reinforcement Learning","date":"2021-07-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/akg-automatic-kernel-generation-for-neural","slug":"akg-automatic-kernel-generation-for-neural","title":"AKG: Automatic Kernel Generation for Neural Processing Units using Polyhedral Transformations","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-bi-level-framework-for-learning-to-solve","slug":"a-bi-level-framework-for-learning-to-solve","title":"A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs","date":"2021-06-09","arxiv_id":"2106.04927","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-bi-level-framework-for-learning-to-solve#ran","syntology_url":"https://syntology.ai/paper/2106.04927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04927"}},"official":{"repos":["thinklab-sjtu/ppo-bihyb"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/chacha-for-online-automl","slug":"chacha-for-online-automl","title":"ChaCha for Online AutoML","date":"2021-06-09","arxiv_id":"2106.04815","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/chacha-for-online-automl#ran","syntology_url":"https://syntology.ai/paper/2106.04815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04815"}},"official":{"repos":["microsoft/FLAML"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/schedulenet-learn-to-solve-multi-agent","slug":"schedulenet-learn-to-solve-multi-agent","title":"ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning","date":"2021-06-06","arxiv_id":"2106.03051","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-schedule","slug":"learning-to-schedule","title":"Scheduling Jobs with Stochastic Holding Costs","date":"2021-05-28","arxiv_id":"2105.13655","repositories_listed":1,"syntology":null},{"url":"/paper/structured-convolutional-kernel-networks-for","slug":"structured-convolutional-kernel-networks-for","title":"Structured Convolutional Kernel Networks for Airline Crew Scheduling","date":"2021-05-25","arxiv_id":"2105.11646","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/structured-convolutional-kernel-networks-for#ran","syntology_url":"https://syntology.ai/paper/2105.11646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11646"}},"official":{"repos":["Yaakoubi/Struct-CKN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-schedule-heuristics-in-branch-and-1","slug":"learning-to-schedule-heuristics-in-branch-and-1","title":"Learning to Schedule Heuristics in Branch and Bound","date":"2021-05-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/recpipe-co-designing-models-and-hardware-to","slug":"recpipe-co-designing-models-and-hardware-to","title":"RecPipe: Co-designing Models and Hardware to Jointly Optimize Recommendation Quality and Performance","date":"2021-05-18","arxiv_id":"2105.08820","repositories_listed":1,"syntology":null},{"url":"/paper/an-intelligent-model-for-solving-manpower","slug":"an-intelligent-model-for-solving-manpower","title":"An Intelligent Model for Solving Manpower Scheduling Problems","date":"2021-05-07","arxiv_id":"2105.03540","repositories_listed":1,"syntology":null},{"url":"/paper/apply-artificial-neural-network-to-solving","slug":"apply-artificial-neural-network-to-solving","title":"Apply Artificial Neural Network to Solving Manpower Scheduling Problem","date":"2021-05-07","arxiv_id":"2105.03541","repositories_listed":1,"syntology":null},{"url":"/paper/a-scalable-and-reproducible-system-on-chip","slug":"a-scalable-and-reproducible-system-on-chip","title":"A Scalable and Reproducible System-on-Chip Simulation for Reinforcement Learning","date":"2021-04-27","arxiv_id":"2104.13187","repositories_listed":1,"syntology":null},{"url":"/paper/towards-standardizing-reinforcement-learning","slug":"towards-standardizing-reinforcement-learning","title":"Towards Standardising Reinforcement Learning Approaches for Production Scheduling Problems","date":"2021-04-16","arxiv_id":"2104.08196","repositories_listed":1,"syntology":null},{"url":"/paper/thermal-neural-networks-lumped-parameter","slug":"thermal-neural-networks-lumped-parameter","title":"Thermal Neural Networks: Lumped-Parameter Thermal Modeling With State-Space Machine Learning","date":"2021-03-30","arxiv_id":"2103.16323","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-schedule-heuristics-in-branch-and","slug":"learning-to-schedule-heuristics-in-branch-and","title":"Learning to Schedule Heuristics in Branch-and-Bound","date":"2021-03-18","arxiv_id":"2103.10294","repositories_listed":1,"syntology":null},{"url":"/paper/es-net-an-efficient-stereo-matching-network","slug":"es-net-an-efficient-stereo-matching-network","title":"ES-Net: An Efficient Stereo Matching Network","date":"2021-03-05","arxiv_id":"2103.03922","repositories_listed":1,"syntology":null},{"url":"/paper/batch-bayesian-optimization-on-permutations","slug":"batch-bayesian-optimization-on-permutations","title":"Batch Bayesian Optimization on Permutations using the Acquisition Weighted Kernel","date":"2021-02-26","arxiv_id":"2102.13382","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/batch-bayesian-optimization-on-permutations#ran","syntology_url":"https://syntology.ai/paper/2102.13382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.13382"}},"official":{"repos":["changyong-oh/law2order"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/making-the-most-of-your-day-online-learning","slug":"making-the-most-of-your-day-online-learning","title":"Making the most of your day: online learning for optimal allocation of time","date":"2021-02-16","arxiv_id":"2102.08087","repositories_listed":1,"syntology":null},{"url":"/paper/deep-reinforcement-agent-for-scheduling-in","slug":"deep-reinforcement-agent-for-scheduling-in","title":"Deep Reinforcement Agent for Scheduling in HPC","date":"2021-02-11","arxiv_id":"2102.06243","repositories_listed":1,"syntology":null},{"url":"/paper/the-factory-must-grow-automation-in-factorio","slug":"the-factory-must-grow-automation-in-factorio","title":"The Factory Must Grow: Automation in Factorio","date":"2021-02-09","arxiv_id":"2102.04871","repositories_listed":1,"syntology":null},{"url":"/paper/proactive-and-aoi-aware-failure-recovery-for","slug":"proactive-and-aoi-aware-failure-recovery-for","title":"Proactive and AoI-aware Failure Recovery for Stateful NFV-enabled Zero-Touch 6G Networks: Model-Free DRL Approach","date":"2021-02-02","arxiv_id":"2103.03817","repositories_listed":1,"syntology":null},{"url":"/paper/federated-learning-in-unreliable-and-resource","slug":"federated-learning-in-unreliable-and-resource","title":"Federated Learning in Unreliable and Resource-Constrained Cellular Wireless Networks","date":"2020-12-09","arxiv_id":"2012.05137","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-charging-networks-a-framework-for","slug":"adaptive-charging-networks-a-framework-for","title":"Adaptive Charging Networks: A Framework for Smart Electric Vehicle Charging","date":"2020-12-04","arxiv_id":"2012.02636","repositories_listed":1,"syntology":null},{"url":"/paper/nimble-lightweight-and-parallel-gpu-task-1","slug":"nimble-lightweight-and-parallel-gpu-task-1","title":"Nimble: Lightweight and Parallel GPU Task Scheduling for Deep Learning","date":"2020-12-04","arxiv_id":"2012.02732","repositories_listed":1,"syntology":null},{"url":"/paper/intelligence-and-learning-in-o-ran-for-data","slug":"intelligence-and-learning-in-o-ran-for-data","title":"Intelligence and Learning in O-RAN for Data-driven NextG Cellular Networks","date":"2020-12-02","arxiv_id":"2012.01263","repositories_listed":1,"syntology":null},{"url":"/paper/seizing-opportunity-maintenance-optimization","slug":"seizing-opportunity-maintenance-optimization","title":"Seizing Opportunity: Maintenance Optimization in Offshore Wind Farms Considering Accessibility, Production, and Crew Dispatch","date":"2020-12-01","arxiv_id":"2012.00213","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-load-forecasting-based-on","slug":"probabilistic-load-forecasting-based-on","title":"Probabilistic Load Forecasting Based on Adaptive Online Learning","date":"2020-11-30","arxiv_id":"2011.14721","repositories_listed":1,"syntology":null},{"url":"/paper/cable-tree-wiring-benchmarking-solvers-on-a","slug":"cable-tree-wiring-benchmarking-solvers-on-a","title":"Cable Tree Wiring -- Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints","date":"2020-11-25","arxiv_id":"2011.12862","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-scheduling-using-graph-neural","slug":"distributed-scheduling-using-graph-neural","title":"Distributed Scheduling using Graph Neural Networks","date":"2020-11-18","arxiv_id":"2011.09430","repositories_listed":1,"syntology":null},{"url":"/paper/automated-large-scale-class-scheduling-in","slug":"automated-large-scale-class-scheduling-in","title":"Automated Large-scale Class Scheduling in MiniZinc","date":"2020-11-15","arxiv_id":"2011.07507","repositories_listed":1,"syntology":null},{"url":"/paper/geometric-deep-reinforcement-learning-for","slug":"geometric-deep-reinforcement-learning-for","title":"Geometric Deep Reinforcement Learning for Dynamic DAG Scheduling","date":"2020-11-09","arxiv_id":"2011.04333","repositories_listed":1,"syntology":null},{"url":"/paper/correlation-aware-cooperative-multigroup","slug":"correlation-aware-cooperative-multigroup","title":"Correlation-aware Cooperative Multigroup Broadcast 360° Video Delivery Network: A Hierarchical Deep Reinforcement Learning Approach","date":"2020-10-21","arxiv_id":"2010.11347","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-resource-allocation-with-multi","slug":"distributed-resource-allocation-with-multi","title":"Distributed Resource Allocation with Multi-Agent Deep Reinforcement Learning for 5G-V2V Communication","date":"2020-10-11","arxiv_id":"2010.05290","repositories_listed":1,"syntology":null},{"url":"/paper/federated-generalized-bayesian-learning-via","slug":"federated-generalized-bayesian-learning-via","title":"Federated Generalized Bayesian Learning via Distributed Stein Variational Gradient Descent","date":"2020-09-11","arxiv_id":"2009.06419","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-scheduling-for-stochastic-edge-cloud","slug":"dynamic-scheduling-for-stochastic-edge-cloud","title":"Dynamic Scheduling for Stochastic Edge-Cloud Computing Environments using A3C learning and Residual Recurrent Neural Networks","date":"2020-09-01","arxiv_id":"2009.02186","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-explanations-for-machine","slug":"counterfactual-explanations-for-machine","title":"Counterfactual Explanations for Machine Learning on Multivariate Time Series Data","date":"2020-08-25","arxiv_id":"2008.10781","repositories_listed":1,"syntology":null},{"url":"/paper/a-multiperiod-workforce-scheduling-and","slug":"a-multiperiod-workforce-scheduling-and","title":"A Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks","date":"2020-08-06","arxiv_id":"2008.02849","repositories_listed":1,"syntology":null},{"url":"/paper/curriculum-learning-for-annotation-efficient","slug":"curriculum-learning-for-annotation-efficient","title":"Curriculum learning for improved femur fracture classification: scheduling data with prior knowledge and uncertainty","date":"2020-07-31","arxiv_id":"2007.16102","repositories_listed":1,"syntology":null},{"url":"/paper/lemma-a-multi-view-dataset-for-learning-multi","slug":"lemma-a-multi-view-dataset-for-learning-multi","title":"LEMMA: A Multi-view Dataset for Learning Multi-agent Multi-task Activities","date":"2020-07-31","arxiv_id":"2007.15781","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lemma-a-multi-view-dataset-for-learning-multi#ran","syntology_url":"https://syntology.ai/paper/2007.15781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15781"}},"official":{"repos":["Buzz-Beater/LEMMA"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mcunet-tiny-deep-learning-on-iot-devices","slug":"mcunet-tiny-deep-learning-on-iot-devices","title":"MCUNet: Tiny Deep Learning on IoT Devices","date":"2020-07-20","arxiv_id":"2007.10319","repositories_listed":1,"syntology":null},{"url":"/paper/node-classification-on-graphs-with-few-shot","slug":"node-classification-on-graphs-with-few-shot","title":"Node Classification on Graphs with Few-Shot Novel Labels via Meta Transformed Network Embedding","date":"2020-07-06","arxiv_id":"2007.02914","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/node-classification-on-graphs-with-few-shot#ran","syntology_url":"https://syntology.ai/paper/2007.02914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02914"}},"official":{"repos":["llan-ml/MetaTNE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}}],"record_sha256":"de8f3724f335f11a663418d36e2ce21f38c40f294baa362249fee9c8c2a427cf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}