{"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/6","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":6,"pages_in_order":32,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/scheduling/papers/7","papers":[{"url":"/paper/multi-armed-bandit-based-client-scheduling","slug":"multi-armed-bandit-based-client-scheduling","title":"Multi-Armed Bandit Based Client Scheduling for Federated Learning","date":"2020-07-05","arxiv_id":"2007.02315","repositories_listed":1,"syntology":null},{"url":"/paper/compositional-video-synthesis-with-action","slug":"compositional-video-synthesis-with-action","title":"Compositional Video Synthesis with Action Graphs","date":"2020-06-27","arxiv_id":"2006.15327","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/compositional-video-synthesis-with-action#ran","syntology_url":"https://syntology.ai/paper/2006.15327","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15327"}},"official":{"repos":["roeiherz/AG2Video"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/metaheuristics-for-the-online-printing-shop","slug":"metaheuristics-for-the-online-printing-shop","title":"Metaheuristics for the Online Printing Shop Scheduling Problem","date":"2020-06-22","arxiv_id":"2006.12344","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-loss-landscape-of-adversarial-training","slug":"on-the-loss-landscape-of-adversarial-training","title":"On the Loss Landscape of Adversarial Training: Identifying Challenges and How to Overcome Them","date":"2020-06-15","arxiv_id":"2006.08403","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":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) · 0 unverified","sample_list":"/paper/on-the-loss-landscape-of-adversarial-training#ran","syntology_url":"https://syntology.ai/paper/2006.08403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08403"}},"official":{"repos":["liuchen11/AdversaryLossLandscape"],"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/communication-efficient-distributed-deep-1","slug":"communication-efficient-distributed-deep-1","title":"A Quantitative Survey of Communication Optimizations in Distributed Deep Learning","date":"2020-05-27","arxiv_id":"2005.13247","repositories_listed":1,"syntology":null},{"url":"/paper/mango-a-python-library-for-parallel","slug":"mango-a-python-library-for-parallel","title":"MANGO: A Python Library for Parallel Hyperparameter Tuning","date":"2020-05-22","arxiv_id":"2005.11394","repositories_listed":1,"syntology":null},{"url":"/paper/towards-streaming-image-understanding","slug":"towards-streaming-image-understanding","title":"Towards Streaming Perception","date":"2020-05-21","arxiv_id":"2005.10420","repositories_listed":1,"syntology":null},{"url":"/paper/deepsocs-a-neural-scheduler-for-heterogeneous","slug":"deepsocs-a-neural-scheduler-for-heterogeneous","title":"DeepSoCS: A Neural Scheduler for Heterogeneous System-on-Chip (SoC) Resource Scheduling","date":"2020-05-15","arxiv_id":"2005.07666","repositories_listed":1,"syntology":null},{"url":"/paper/a-flexible-storage-model-for-power-network","slug":"a-flexible-storage-model-for-power-network","title":"A Flexible Storage Model for Power Network Optimization","date":"2020-04-29","arxiv_id":"2004.14768","repositories_listed":1,"syntology":null},{"url":"/paper/curiosity-driven-energy-efficient-worker","slug":"curiosity-driven-energy-efficient-worker","title":"Curiosity-Driven Energy-Efficient Worker Scheduling in Vehicular Crowdsourcing: A Deep Reinforcement Learning Approach","date":"2020-04-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-fusion-network-for-multi-domain-end","slug":"dynamic-fusion-network-for-multi-domain-end","title":"Dynamic Fusion Network for Multi-Domain End-to-end Task-Oriented Dialog","date":"2020-04-23","arxiv_id":"2004.11019","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/dynamic-fusion-network-for-multi-domain-end#ran","syntology_url":"https://syntology.ai/paper/2004.11019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11019"}},"official":{"repos":["LooperXX/DF-Net"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/heterogeneous-cpu-gpu-stochastic-gradient","slug":"heterogeneous-cpu-gpu-stochastic-gradient","title":"Heterogeneous CPU+GPU Stochastic Gradient Descent Algorithms","date":"2020-04-19","arxiv_id":"2004.08771","repositories_listed":1,"syntology":null},{"url":"/paper/quantum-approximation-for-multi-scale","slug":"quantum-approximation-for-multi-scale","title":"Quantum Approximation for Multi-Scale Scheduling","date":"2020-04-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-prediction-of-route-level-energy","slug":"data-driven-prediction-of-route-level-energy","title":"Data-Driven Prediction of Route-Level Energy Use for Mixed-Vehicle Transit Fleets","date":"2020-04-10","arxiv_id":"2004.06043","repositories_listed":1,"syntology":null},{"url":"/paper/multipath-computation-offloading-for-mobile","slug":"multipath-computation-offloading-for-mobile","title":"Multipath Computation Offloading for Mobile Augmented Reality","date":"2020-03-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/train-scheduling-with-hybrid-answer-set","slug":"train-scheduling-with-hybrid-answer-set","title":"Train Scheduling with Hybrid Answer Set Programming","date":"2020-03-19","arxiv_id":"2003.08598","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-and-solving-a-vehicle-sharing","slug":"modeling-and-solving-a-vehicle-sharing","title":"Modeling and solving a vehicle-sharing problem considering multiple alternative modes of transport","date":"2020-03-17","arxiv_id":"2003.08207","repositories_listed":1,"syntology":null},{"url":"/paper/mnn-a-universal-and-efficient-inference","slug":"mnn-a-universal-and-efficient-inference","title":"MNN: A Universal and Efficient Inference Engine","date":"2020-02-27","arxiv_id":"2002.12418","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mnn-a-universal-and-efficient-inference#ran","syntology_url":"https://syntology.ai/paper/2002.12418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12418"}},"official":{"repos":["alibaba/MNN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/statistical-adaptive-stochastic-gradient","slug":"statistical-adaptive-stochastic-gradient","title":"Statistical Adaptive Stochastic Gradient Methods","date":"2020-02-25","arxiv_id":"2002.10597","repositories_listed":1,"syntology":null},{"url":"/paper/meuzz-smart-seed-scheduling-for-hybrid","slug":"meuzz-smart-seed-scheduling-for-hybrid","title":"MEUZZ: Smart Seed Scheduling for Hybrid Fuzzing","date":"2020-02-20","arxiv_id":"2002.08568","repositories_listed":1,"syntology":null},{"url":"/paper/a-stochastic-game-framework-for-efficient","slug":"a-stochastic-game-framework-for-efficient","title":"A Stochastic Game Framework for Efficient Energy Management in Microgrid Networks","date":"2020-02-06","arxiv_id":"2002.02084","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-flexible-electric-loads","slug":"benchmarking-flexible-electric-loads","title":"Benchmarking Flexible Electric Loads Scheduling Algorithms under Market Price Uncertainty","date":"2020-02-04","arxiv_id":"2002.01246","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-impact-of-modern-deep-learning","slug":"on-the-impact-of-modern-deep-learning","title":"On the impact of selected modern deep-learning techniques to the performance and celerity of classification models in an experimental high-energy physics use case","date":"2020-02-03","arxiv_id":"2002.01427","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-model-for-portable-and-fast","slug":"a-simple-model-for-portable-and-fast","title":"A Simple Model for Portable and Fast Prediction of Execution Time and Power Consumption of GPU Kernels","date":"2020-01-20","arxiv_id":"2001.07104","repositories_listed":1,"syntology":null},{"url":"/paper/cprop-adaptive-learning-rate-scaling-from","slug":"cprop-adaptive-learning-rate-scaling-from","title":"CProp: Adaptive Learning Rate Scaling from Past Gradient Conformity","date":"2019-12-24","arxiv_id":"1912.11493","repositories_listed":1,"syntology":null},{"url":"/paper/variational-learning-with-disentanglement","slug":"variational-learning-with-disentanglement","title":"Variational Learning with Disentanglement-PyTorch","date":"2019-12-11","arxiv_id":"1912.05184","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/variational-learning-with-disentanglement#ran","syntology_url":"https://syntology.ai/paper/1912.05184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.05184"}},"official":{"repos":["amir-abdi/disentanglement-pytorch"],"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/work-in-progress-a-deep-learning-strategy-for","slug":"work-in-progress-a-deep-learning-strategy-for","title":"Work-in-progress: a deep learning strategy for I/O scheduling in storage systems","date":"2019-12-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/staying-up-to-date-with-online-content","slug":"staying-up-to-date-with-online-content","title":"Staying up to Date with Online Content Changes Using Reinforcement Learning for Scheduling","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/smart-predict-and-optimize-for-hard","slug":"smart-predict-and-optimize-for-hard","title":"Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems","date":"2019-11-22","arxiv_id":"1911.10092","repositories_listed":1,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/smart-predict-and-optimize-for-hard#ran","syntology_url":"https://syntology.ai/paper/1911.10092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.10092"}},"official":{"repos":["JayMan91/aaai_predit_then_optimize"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/radiounet-fast-radio-map-estimation-with","slug":"radiounet-fast-radio-map-estimation-with","title":"RadioUNet: Fast Radio Map Estimation with Convolutional Neural Networks","date":"2019-11-17","arxiv_id":"1911.09002","repositories_listed":1,"syntology":null},{"url":"/paper/variational-learning-with-disentanglement-1","slug":"variational-learning-with-disentanglement-1","title":"Variational Learning with Disentanglement-PyTorch","date":"2019-11-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/auptimizer-an-extensible-open-source","slug":"auptimizer-an-extensible-open-source","title":"Auptimizer -- an Extensible, Open-Source Framework for Hyperparameter Tuning","date":"2019-11-06","arxiv_id":"1911.02522","repositories_listed":1,"syntology":null},{"url":"/paper/long-term-joint-scheduling-for-urban-traffic","slug":"long-term-joint-scheduling-for-urban-traffic","title":"Long-term Joint Scheduling for Urban Traffic","date":"2019-10-27","arxiv_id":"1910.12283","repositories_listed":1,"syntology":null},{"url":"/paper/rlscheduler-learn-to-schedule-hpc-batch-jobs","slug":"rlscheduler-learn-to-schedule-hpc-batch-jobs","title":"RLScheduler: An Automated HPC Batch Job Scheduler Using Reinforcement Learning","date":"2019-10-20","arxiv_id":"1910.08925","repositories_listed":1,"syntology":null},{"url":"/paper/scheduling-the-learning-rate-via-1","slug":"scheduling-the-learning-rate-via-1","title":"MARTHE: Scheduling the Learning Rate Via Online Hypergradients","date":"2019-10-18","arxiv_id":"1910.08525","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 5 unverified","sample_list":"/paper/scheduling-the-learning-rate-via-1#ran","syntology_url":"https://syntology.ai/paper/1910.08525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.08525"}},"official":{"repos":["awslabs/adatune"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/prediction-based-resource-allocation-using","slug":"prediction-based-resource-allocation-using","title":"Prediction-based Resource Allocation using Bayesian Neural Networks and Minimum Cost and Maximum Flow Algorithm","date":"2019-10-11","arxiv_id":"1910.05126","repositories_listed":1,"syntology":null},{"url":"/paper/message-scheduling-for-performant-many-core","slug":"message-scheduling-for-performant-many-core","title":"Message Scheduling for Performant, Many-Core Belief Propagation","date":"2019-09-24","arxiv_id":"1909.11469","repositories_listed":1,"syntology":null},{"url":"/paper/google-vs-ibm-a-constraint-solving-challenge","slug":"google-vs-ibm-a-constraint-solving-challenge","title":"Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem","date":"2019-09-18","arxiv_id":"1909.08247","repositories_listed":1,"syntology":null},{"url":"/paper/dl2-a-deep-learning-driven-scheduler-for-deep","slug":"dl2-a-deep-learning-driven-scheduler-for-deep","title":"DL2: A Deep Learning-driven Scheduler for Deep Learning Clusters","date":"2019-09-13","arxiv_id":"1909.06040","repositories_listed":1,"syntology":null},{"url":"/paper/prema-a-predictive-multi-task-scheduling","slug":"prema-a-predictive-multi-task-scheduling","title":"PREMA: A Predictive Multi-task Scheduling Algorithm For Preemptible Neural Processing Units","date":"2019-09-06","arxiv_id":"1909.04548","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-apprenticeship-learning-from","slug":"personalized-apprenticeship-learning-from","title":"Interpretable and Personalized Apprenticeship Scheduling: Learning Interpretable Scheduling Policies from Heterogeneous User Demonstrations","date":"2019-06-14","arxiv_id":"1906.06397","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/personalized-apprenticeship-learning-from#ran","syntology_url":"https://syntology.ai/paper/1906.06397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06397"}},"official":{"repos":["core-robotics-lab/personalized_neural_trees"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/associated-learning-decomposing-end-to-end","slug":"associated-learning-decomposing-end-to-end","title":"Associated Learning: Decomposing End-to-end Backpropagation based on Auto-encoders and Target Propagation","date":"2019-06-13","arxiv_id":"1906.05560","repositories_listed":1,"syntology":null},{"url":"/paper/graph-embedding-based-wireless-link","slug":"graph-embedding-based-wireless-link","title":"Graph Embedding based Wireless Link Scheduling with Few Training Samples","date":"2019-06-07","arxiv_id":"1906.02871","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-meets-stochastic-geometry","slug":"machine-learning-meets-stochastic-geometry","title":"Machine Learning meets Stochastic Geometry: Determinantal Subset Selection for Wireless Networks","date":"2019-05-01","arxiv_id":"1905.00504","repositories_listed":1,"syntology":null},{"url":"/paper/using-smt-solvers-to-validate-models-for-ai","slug":"using-smt-solvers-to-validate-models-for-ai","title":"Using SMT Solvers to Validate Models for AI Problems","date":"2019-03-22","arxiv_id":"1903.09475","repositories_listed":1,"syntology":null},{"url":"/paper/episodic-memory-reader-learning-what-to","slug":"episodic-memory-reader-learning-what-to","title":"Episodic Memory Reader: Learning What to Remember for Question Answering from Streaming Data","date":"2019-03-14","arxiv_id":"1903.06164","repositories_listed":1,"syntology":null},{"url":"/paper/neurocore-guiding-cdcl-with-unsat-core","slug":"neurocore-guiding-cdcl-with-unsat-core","title":"Guiding High-Performance SAT Solvers with Unsat-Core Predictions","date":"2019-03-12","arxiv_id":"1903.04671","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neurocore-guiding-cdcl-with-unsat-core#ran","syntology_url":"https://syntology.ai/paper/1903.04671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.04671"}},"official":{"repos":["dselsam/neurocore-public"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/salus-fine-grained-gpu-sharing-primitives-for","slug":"salus-fine-grained-gpu-sharing-primitives-for","title":"Salus: Fine-Grained GPU Sharing Primitives for Deep Learning Applications","date":"2019-02-12","arxiv_id":"1902.04610","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-schedule-communication-in-multi","slug":"learning-to-schedule-communication-in-multi","title":"Learning to Schedule Communication in Multi-agent Reinforcement Learning","date":"2019-02-05","arxiv_id":"1902.01554","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-measurement-scheduling-for-event","slug":"dynamic-measurement-scheduling-for-event","title":"Dynamic Measurement Scheduling for Event Forecasting using Deep RL","date":"2019-01-24","arxiv_id":"1901.09699","repositories_listed":1,"syntology":null},{"url":"/paper/using-solar-and-load-predictions-in-battery","slug":"using-solar-and-load-predictions-in-battery","title":"Using solar and load predictions in battery scheduling at the residential level","date":"2018-10-26","arxiv_id":"1810.11178","repositories_listed":1,"syntology":null},{"url":"/paper/a-resource-allocation-based-approach-for","slug":"a-resource-allocation-based-approach-for","title":"Mobility Offer Allocations in Corporate Settings","date":"2018-10-11","arxiv_id":"1810.05659","repositories_listed":1,"syntology":null},{"url":"/paper/determinantal-thinning-of-point-processes","slug":"determinantal-thinning-of-point-processes","title":"Determinantal thinning of point processes with network learning applications","date":"2018-10-09","arxiv_id":"1810.08672","repositories_listed":1,"syntology":null},{"url":"/paper/autoloss-learning-discrete-schedules-for","slug":"autoloss-learning-discrete-schedules-for","title":"AutoLoss: Learning Discrete Schedules for Alternate Optimization","date":"2018-10-04","arxiv_id":"1810.02442","repositories_listed":1,"syntology":null},{"url":"/paper/layer-compensated-pruning-for-resource","slug":"layer-compensated-pruning-for-resource","title":"Layer-compensated Pruning for Resource-constrained Convolutional Neural Networks","date":"2018-10-01","arxiv_id":"1810.00518","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-local-rewriting-for-combinatorial","slug":"automatic-local-rewriting-for-combinatorial","title":"Learning to Perform Local Rewriting for Combinatorial Optimization","date":"2018-09-30","arxiv_id":"1810.00337","repositories_listed":1,"syntology":null},{"url":"/paper/learning-user-preferences-and-understanding","slug":"learning-user-preferences-and-understanding","title":"Learning User Preferences and Understanding Calendar Contexts for Event Scheduling","date":"2018-09-05","arxiv_id":"1809.01316","repositories_listed":1,"syntology":null},{"url":"/paper/spatial-deep-learning-for-wireless-scheduling","slug":"spatial-deep-learning-for-wireless-scheduling","title":"Spatial Deep Learning for Wireless Scheduling","date":"2018-08-04","arxiv_id":"1808.01486","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-deep-reinforcement-learning-for-1","slug":"multi-agent-deep-reinforcement-learning-for-1","title":"Multi-Agent Deep Reinforcement Learning for Dynamic Power Allocation in Wireless Networks","date":"2018-08-01","arxiv_id":"1808.00490","repositories_listed":1,"syntology":null},{"url":"/paper/self-paced-learning-with-adaptive-deep-visual","slug":"self-paced-learning-with-adaptive-deep-visual","title":"Self-Paced Learning with Adaptive Deep Visual Embeddings","date":"2018-07-24","arxiv_id":"1807.09200","repositories_listed":1,"syntology":null},{"url":"/paper/optimus-an-efficient-dynamic-resource","slug":"optimus-an-efficient-dynamic-resource","title":"Optimus: An Efficient Dynamic Resource Scheduler for Deep Learning Clusters","date":"2018-04-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tictac-accelerating-distributed-deep-learning","slug":"tictac-accelerating-distributed-deep-learning","title":"TicTac: Accelerating Distributed Deep Learning with Communication Scheduling","date":"2018-03-08","arxiv_id":"1803.03288","repositories_listed":1,"syntology":null},{"url":"/paper/federated-control-with-hierarchical-multi","slug":"federated-control-with-hierarchical-multi","title":"Federated Control with Hierarchical Multi-Agent Deep Reinforcement Learning","date":"2017-12-22","arxiv_id":"1712.08266","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-real-time-vehicle-placement-problem","slug":"on-the-real-time-vehicle-placement-problem","title":"On the Real-time Vehicle Placement Problem","date":"2017-12-04","arxiv_id":"1712.01235","repositories_listed":1,"syntology":null},{"url":"/paper/solving-the-resource-constrained-project","slug":"solving-the-resource-constrained-project","title":"Solving the Resource Constrained Project Scheduling Problem Using the Parallel Tabu Search Designed for the CUDA Platform","date":"2017-11-13","arxiv_id":"1711.04556","repositories_listed":1,"syntology":null},{"url":"/paper/task-based-end-to-end-model-learning-in","slug":"task-based-end-to-end-model-learning-in","title":"Task-based End-to-end Model Learning in Stochastic Optimization","date":"2017-03-13","arxiv_id":"1703.04529","repositories_listed":1,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/task-based-end-to-end-model-learning-in#ran","syntology_url":"https://syntology.ai/paper/1703.04529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04529"}},"official":{"repos":["locuslab/e2e-model-learning"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/clockwork-convnets-for-video-semantic","slug":"clockwork-convnets-for-video-semantic","title":"Clockwork Convnets for Video Semantic Segmentation","date":"2016-08-11","arxiv_id":"1608.03609","repositories_listed":1,"syntology":null},{"url":"/paper/unbounded-human-learning-optimal-scheduling","slug":"unbounded-human-learning-optimal-scheduling","title":"Unbounded Human Learning: Optimal Scheduling for Spaced Repetition","date":"2016-02-23","arxiv_id":"1602.07032","repositories_listed":1,"syntology":null},{"url":"/paper/rankmap-a-platform-aware-framework-for","slug":"rankmap-a-platform-aware-framework-for","title":"RankMap: A Platform-Aware Framework for Distributed Learning from Dense Datasets","date":"2015-03-27","arxiv_id":"1503.08169","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-constraints","slug":"statistical-constraints","title":"Statistical Constraints","date":"2014-02-20","arxiv_id":"1402.5161","repositories_listed":1,"syntology":null},{"url":"/paper/an-ant-colony-optimization-algorithm-for-job","slug":"an-ant-colony-optimization-algorithm-for-job","title":"An ant colony optimization algorithm for job shop scheduling problem","date":"2013-09-19","arxiv_id":"1309.5110","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-bacterial-foraging-algorithm-for","slug":"a-hybrid-bacterial-foraging-algorithm-for","title":"A Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problems","date":"2012-11-21","arxiv_id":"1211.4971","repositories_listed":1,"syntology":null},{"url":"/paper/on-an-exact-method-for-the-constrained","slug":"on-an-exact-method-for-the-constrained","title":"On an exact method for the constrained shortest path problem","date":"2012-07-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pddl2-1-an-extension-to-pddl-for-expressing","slug":"pddl2-1-an-extension-to-pddl-for-expressing","title":"PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains","date":"2011-06-22","arxiv_id":"1106.4561","repositories_listed":1,"syntology":null},{"url":null,"slug":"an-end-to-end-dnn-inference-framework-for-the","title":"An End-to-End DNN Inference Framework for the SpiNNaker2 Neuromorphic MPSoC","date":"2025-07-18","arxiv_id":"2507.13736","repositories_listed":0,"syntology":null},{"url":null,"slug":"autonomous-resource-management-in-1","title":"Autonomous Resource Management in Microservice Systems via Reinforcement Learning","date":"2025-07-17","arxiv_id":"2507.12879","repositories_listed":0,"syntology":null},{"url":null,"slug":"formulaone-measuring-the-depth-of-algorithmic","title":"FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming","date":"2025-07-17","arxiv_id":"2507.13337","repositories_listed":0,"syntology":null},{"url":null,"slug":"fremer-lightweight-and-effective-frequency","title":"Fremer: Lightweight and Effective Frequency Transformer for Workload Forecasting in Cloud Services","date":"2025-07-17","arxiv_id":"2507.12908","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-asynchronous-cross-border-market","title":"Leveraging Asynchronous Cross-border Market Data for Improved Day-Ahead Electricity Price Forecasting in European Markets","date":"2025-07-17","arxiv_id":"2507.13250","repositories_listed":0,"syntology":null},{"url":null,"slug":"transient-stability-aware-frequency-provision","title":"Transient-Stability-Aware Frequency Provision in IBR-Rich Grids via Information Gap Decision Theory and Deep Learning","date":"2025-07-17","arxiv_id":"2507.13265","repositories_listed":0,"syntology":null},{"url":null,"slug":"elk-exploring-the-efficiency-of-inter-core","title":"Elk: Exploring the Efficiency of Inter-core Connected AI Chips with Deep Learning Compiler Techniques","date":"2025-07-15","arxiv_id":"2507.11506","repositories_listed":0,"syntology":null},{"url":null,"slug":"bitparticle-partializing-sparse-dual-factors","title":"BitParticle: Partializing Sparse Dual-Factors to Build Quasi-Synchronizing MAC Arrays for Energy-efficient DNNs","date":"2025-07-13","arxiv_id":"2507.09780","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-adaptive-volatility-based-learning-rate","title":"An Adaptive Volatility-based Learning Rate Scheduler","date":"2025-07-11","arxiv_id":"2507.10575","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-task-offloading-for-uav-assisted","title":"Hierarchical Task Offloading for UAV-Assisted Vehicular Edge Computing via Deep Reinforcement Learning","date":"2025-07-08","arxiv_id":"2507.05722","repositories_listed":0,"syntology":null},{"url":null,"slug":"openagentsafety-a-comprehensive-framework-for","title":"OpenAgentSafety: A Comprehensive Framework for Evaluating Real-World AI Agent Safety","date":"2025-07-08","arxiv_id":"2507.06134","repositories_listed":0,"syntology":null},{"url":null,"slug":"co-design-of-sensing-communications-and","title":"Co-Design of Sensing, Communications, and Control for Low-Altitude Wireless Networks","date":"2025-06-26","arxiv_id":"2506.20970","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-diffusion-based-image-editing","title":"Improving Diffusion-Based Image Editing Faithfulness via Guidance and Scheduling","date":"2025-06-26","arxiv_id":"2506.21045","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-scheduling-of-der-under-demand-charges","title":"Joint Scheduling of DER under Demand Charges: Structure and Approximation","date":"2025-06-26","arxiv_id":"2506.21510","repositories_listed":0,"syntology":null},{"url":null,"slug":"predictive-maintenance-optimization-for-smart","title":"Predictive Maintenance Optimization for Smart Vending Machines Using IoT and Machine Learning","date":"2025-06-26","arxiv_id":"2507.02934","repositories_listed":0,"syntology":null},{"url":null,"slug":"magpie-a-dataset-for-multi-agent-contextual","title":"MAGPIE: A dataset for Multi-AGent contextual PrIvacy Evaluation","date":"2025-06-25","arxiv_id":"2506.20737","repositories_listed":0,"syntology":null},{"url":null,"slug":"milaap-mobile-link-allocation-via-attention","title":"MILAAP: Mobile Link Allocation via Attention-based Prediction","date":"2025-06-24","arxiv_id":"2506.19947","repositories_listed":0,"syntology":null},{"url":null,"slug":"finite-time-information-theoretic-bounds-in","title":"Finite-Time Information-Theoretic Bounds in Queueing Control","date":"2025-06-23","arxiv_id":"2506.18278","repositories_listed":0,"syntology":null},{"url":"/paper/plan-for-speed-dilated-scheduling-for-masked","slug":"plan-for-speed-dilated-scheduling-for-masked","title":"Plan for Speed -- Dilated Scheduling for Masked Diffusion Language Models","date":"2025-06-23","arxiv_id":"2506.19037","repositories_listed":0,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/plan-for-speed-dilated-scheduling-for-masked#ran","syntology_url":"https://syntology.ai/paper/2506.19037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.19037"}},"official":null}},{"url":null,"slug":"research-on-model-parallelism-and-data","title":"Research on Model Parallelism and Data Parallelism Optimization Methods in Large Language Model-Based Recommendation Systems","date":"2025-06-21","arxiv_id":"2506.17551","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simplified-analysis-of-sgd-for-linear","title":"A Simplified Analysis of SGD for Linear Regression with Weight Averaging","date":"2025-06-18","arxiv_id":"2506.15535","repositories_listed":0,"syntology":null},{"url":null,"slug":"asap-fe-energy-efficient-feature-extraction","title":"ASAP-FE: Energy-Efficient Feature Extraction Enabling Multi-Channel Keyword Spotting on Edge Processors","date":"2025-06-17","arxiv_id":"2506.14657","repositories_listed":0,"syntology":null},{"url":null,"slug":"cnn-enabled-scheduling-for-probabilistic-real","title":"CNN-Enabled Scheduling for Probabilistic Real-Time Guarantees in Industrial URLLC","date":"2025-06-17","arxiv_id":"2506.14987","repositories_listed":0,"syntology":null},{"url":null,"slug":"considering-the-multi-time-scale-rolling","title":"Considering the multi-time scale rolling optimization scheduling method of micro-energy network connected to electric vehicles","date":"2025-06-17","arxiv_id":"2506.14112","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-serving-of-llm-applications-with","title":"Efficient Serving of LLM Applications with Probabilistic Demand Modeling","date":"2025-06-17","arxiv_id":"2506.14851","repositories_listed":0,"syntology":null},{"url":null,"slug":"gcn-driven-reinforcement-learning-for","title":"GCN-Driven Reinforcement Learning for Probabilistic Real-Time Guarantees in Industrial URLLC","date":"2025-06-17","arxiv_id":"2506.15011","repositories_listed":0,"syntology":null}],"record_sha256":"799b8b34e0c57e4f11592beb16711d1f93e4308adcf872570b192140e17476fa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}