{"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/31","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":31,"pages_in_order":32,"rows_per_page":100,"rows":[3001,3100],"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/30","next":"/task/scheduling/papers/32","papers":[{"url":null,"slug":"online-learning-schemes-for-power-allocation","title":"Online Learning Schemes for Power Allocation in Energy Harvesting Communications","date":"2016-07-08","arxiv_id":"1607.02552","repositories_listed":0,"syntology":null},{"url":null,"slug":"cnnlab-a-novel-parallel-framework-for-neural","title":"CNNLab: a Novel Parallel Framework for Neural Networks using GPU and FPGA-a Practical Study with Trade-off Analysis","date":"2016-06-20","arxiv_id":"1606.06234","repositories_listed":0,"syntology":null},{"url":null,"slug":"interdependent-scheduling-games","title":"Interdependent Scheduling Games","date":"2016-05-31","arxiv_id":"1605.09497","repositories_listed":0,"syntology":null},{"url":null,"slug":"elastic-solver-balancing-solution-time-and","title":"Elastic Solver: Balancing Solution Time and Energy Consumption","date":"2016-05-23","arxiv_id":"1605.06940","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-performance-computing-for-scheduling","title":"High-Performance Computing for Scheduling Decision Support: A Parallel Depth-First Search Heuristic","date":"2016-05-16","arxiv_id":"1605.04682","repositories_listed":0,"syntology":null},{"url":null,"slug":"resource-allocation-using-metaheuristic","title":"Resource allocation using metaheuristic search","date":"2016-05-06","arxiv_id":"1605.01855","repositories_listed":0,"syntology":null},{"url":null,"slug":"highly-accurate-prediction-of-jobs-runtime","title":"Highly Accurate Prediction of Jobs Runtime Classes","date":"2016-05-02","arxiv_id":"1605.00388","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-scheduling-system-for-uav-operations-in","title":"Task scheduling system for UAV operations in indoor environment","date":"2016-04-21","arxiv_id":"1604.06223","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-route-planning-with-prioritized-task","title":"Optimal Route Planning with Prioritized Task Scheduling for AUV Missions","date":"2016-04-12","arxiv_id":"1604.03303","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-ant-colony-optimization-in-solving","title":"Hybrid Ant Colony Optimization in solving Multi-Skill Resource-Constrained Project Scheduling Problem","date":"2016-03-28","arxiv_id":"1603.08538","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-the-learning-order-of-chinese","title":"Optimizing the Learning Order of Chinese Characters Using a Novel Topological Sort Algorithm","date":"2016-02-28","arxiv_id":"1602.08742","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-resource-networks","title":"Time Resource Networks","date":"2016-02-09","arxiv_id":"1602.03203","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-event-based-epidemiological-simulations","title":"Fast event-based epidemiological simulations on national scales","date":"2016-01-27","arxiv_id":"1502.02908","repositories_listed":0,"syntology":null},{"url":null,"slug":"coalition-based-planning-of-military","title":"Coalition-based Planning of Military Operations: Adversarial Reasoning Algorithms in an Integrated Decision Aid","date":"2016-01-22","arxiv_id":"1601.06069","repositories_listed":0,"syntology":null},{"url":null,"slug":"decision-aids-for-adversarial-planning-in","title":"Decision Aids for Adversarial Planning in Military Operations: Algorithms, Tools, and Turing-test-like Experimental Validation","date":"2016-01-22","arxiv_id":"1601.06108","repositories_listed":0,"syntology":null},{"url":null,"slug":"resource-sharing-for-multi-tenant-nosql-data","title":"Resource Sharing for Multi-Tenant NoSQL Data Store in Cloud","date":"2016-01-05","arxiv_id":"1601.00738","repositories_listed":0,"syntology":null},{"url":null,"slug":"solution-repairrecovery-in-uncertain","title":"Solution Repair/Recovery in Uncertain Optimization Environment","date":"2015-11-18","arxiv_id":"1511.05749","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-optimization-with-dimension","title":"Bayesian Optimization with Dimension Scheduling: Application to Biological Systems","date":"2015-11-17","arxiv_id":"1511.05385","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-monte-carlo-and-hyper-heuristic","title":"Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem","date":"2015-11-13","arxiv_id":"1511.04387","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-inductive-constraint-programming-loop","title":"The Inductive Constraint Programming Loop","date":"2015-10-12","arxiv_id":"1510.03317","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-agent-system-approach-to-load","title":"A Multi-Agent System Approach to Load-Balancing and Resource Allocation for Distributed Computing","date":"2015-09-21","arxiv_id":"1509.06420","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-heuristic-and-an-annotated","title":"A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems","date":"2015-09-08","arxiv_id":"1509.02384","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-a-truly-distributed-constraint","title":"Building a Truly Distributed Constraint Solver with JADE","date":"2015-09-03","arxiv_id":"1509.01040","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-weak-constraints-in-answer-set","title":"Learning Weak Constraints in Answer Set Programming","date":"2015-07-23","arxiv_id":"1507.06566","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-for-the-unit","title":"Reinforcement Learning for the Unit Commitment Problem","date":"2015-07-19","arxiv_id":"1507.05268","repositories_listed":0,"syntology":null},{"url":null,"slug":"managing-autonomous-mobility-on-demand","title":"Managing Autonomous Mobility on Demand Systems for Better Passenger Experience","date":"2015-07-09","arxiv_id":"1507.02563","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-multi-strand-graph-for-a-ptz-tracker","title":"The Multi-Strand Graph for a PTZ Tracker","date":"2015-06-29","arxiv_id":"1506.08485","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-impact-of-estimation-a-new-method-for","title":"The Impact of Estimation: A New Method for Clustering and Trajectory Estimation in Patient Flow Modeling","date":"2015-05-28","arxiv_id":"1505.07752","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-constraint-programming-approach-for-non","title":"A Constraint Programming Approach for Non-Preemptive Evacuation Scheduling","date":"2015-05-11","arxiv_id":"1505.02487","repositories_listed":0,"syntology":null},{"url":null,"slug":"further-connections-between-contract","title":"Further Connections Between Contract-Scheduling and Ray-Searching Problems","date":"2015-04-27","arxiv_id":"1504.07168","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-runtime-of-randomized-local-search-and","title":"On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling","date":"2015-04-23","arxiv_id":"1504.06363","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-online-approach-to-dynamic-channel-access","title":"An Online Approach to Dynamic Channel Access and Transmission Scheduling","date":"2015-04-04","arxiv_id":"1504.01050","repositories_listed":0,"syntology":null},{"url":null,"slug":"whittle-index-policy-for-crawling-ephemeral","title":"Whittle Index Policy for Crawling Ephemeral Content","date":"2015-03-30","arxiv_id":"1503.08558","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-aircraft-engine-diagnostic-via","title":"Interpretable Aircraft Engine Diagnostic via Expert Indicator Aggregation","date":"2015-03-18","arxiv_id":"1503.05526","repositories_listed":0,"syntology":null},{"url":null,"slug":"simulation-of-genetic-algorithm-traffic-light","title":"Simulation of Genetic Algorithm: Traffic Light Efficiency","date":"2015-03-15","arxiv_id":"1503.04475","repositories_listed":0,"syntology":null},{"url":null,"slug":"fuzzy-mixed-integer-linear-programming-for","title":"Fuzzy Mixed Integer Linear Programming for Air Vehicles Operations Optimization","date":"2015-03-13","arxiv_id":"1503.04222","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-optimization-of-annealing","title":"Variational Optimization of Annealing Schedules","date":"2015-02-18","arxiv_id":"1502.05313","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-v2g-scheduling-of-electric-vehicles","title":"Optimal V2G Scheduling of Electric Vehicles and Unit Commitment using Chemical Reaction Optimization","date":"2015-02-01","arxiv_id":"1502.00196","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-local-search-limitation-strategy","title":"Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times","date":"2015-01-23","arxiv_id":"1501.05882","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-access-communications-with-energy","title":"Multi-Access Communications with Energy Harvesting: A Multi-Armed Bandit Model and the Optimality of the Myopic Policy","date":"2015-01-01","arxiv_id":"1501.00329","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-optimal-recombination-in-genetic","title":"Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups","date":"2014-12-16","arxiv_id":"1412.5067","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-model-parallelization-and-scheduling","title":"On Model Parallelization and Scheduling Strategies for Distributed Machine Learning","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tabu-search-algorithm-for-the-multi-period","title":"A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem","date":"2014-09-17","arxiv_id":"1409.5166","repositories_listed":0,"syntology":null},{"url":null,"slug":"memcomputing-and-swarm-intelligence","title":"Memcomputing and Swarm Intelligence","date":"2014-08-28","arxiv_id":"1408.6741","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-sweep-filtering-algorithm-for-flexc","title":"Dynamic Sweep Filtering Algorithm for FlexC","date":"2014-08-22","arxiv_id":"1408.5377","repositories_listed":0,"syntology":null},{"url":null,"slug":"charge-scheduling-of-an-energy-storage-system","title":"Charge Scheduling of an Energy Storage System under Time-of-use Pricing and a Demand Charge","date":"2014-07-11","arxiv_id":"1407.3077","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparison-of-scheduling-methods-for-the","title":"Comparison of scheduling methods for the learning rate of neural network language models (Mod\\`eles de langue neuronaux: une comparaison de plusieurs strat\\'egies d'apprentissage) [in French]","date":"2014-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"primitives-for-dynamic-big-model-parallelism","title":"Primitives for Dynamic Big Model Parallelism","date":"2014-06-18","arxiv_id":"1406.4580","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-an-asp-based-architecture-for","title":"Towards an ASP-Based Architecture for Autonomous UAVs in Dynamic Environments (Extended Abstract)","date":"2014-05-21","arxiv_id":"1405.5443","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-design-of-the-fifth-answer-set","title":"The Design of the Fifth Answer Set Programming Competition","date":"2014-05-14","arxiv_id":"1405.3710","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-asp-based-architecture-for-autonomous-uavs","title":"An ASP-Based Architecture for Autonomous UAVs in Dynamic Environments: Progress Report","date":"2014-05-06","arxiv_id":"1405.1124","repositories_listed":0,"syntology":null},{"url":null,"slug":"nastia-negotiating-appointment-setting","title":"NASTIA: Negotiating Appointment Setting Interface","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-genetic-algorithm-for-cloud-computing","title":"Hybrid Genetic Algorithm for Cloud Computing Applications","date":"2014-04-22","arxiv_id":"1404.5528","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-deformable-part-models","title":"Active Deformable Part Models","date":"2014-04-01","arxiv_id":"1404.0334","repositories_listed":0,"syntology":null},{"url":null,"slug":"renewable-energy-prediction-using-weather","title":"Renewable Energy Prediction using Weather Forecasts for Optimal Scheduling in HPC Systems","date":"2014-02-26","arxiv_id":"1402.6552","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-dynamic-job-scheduling-in-grid","title":"A Survey on Dynamic Job Scheduling in Grid Environment Based on Heuristic Algorithms","date":"2014-02-21","arxiv_id":"1402.5205","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-planning-for-continuous-dynamic","title":"Probabilistic Planning for Continuous Dynamic Systems under Bounded Risk","date":"2014-02-04","arxiv_id":"1402.0579","repositories_listed":0,"syntology":null},{"url":null,"slug":"protecting-privacy-through-distributed","title":"Protecting Privacy through Distributed Computation in Multi-agent Decision Making","date":"2014-02-04","arxiv_id":"1402.0589","repositories_listed":0,"syntology":null},{"url":null,"slug":"scheduling-a-dynamic-aircraft-repair-shop","title":"Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources","date":"2014-02-04","arxiv_id":"1402.0582","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-enhanced-branch-and-bound-algorithm-for","title":"An Enhanced Branch-and-bound Algorithm for the Talent Scheduling Problem","date":"2014-01-23","arxiv_id":"1401.5869","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-approximate-solutions-to-the-ttp","title":"Generating Approximate Solutions to the TTP using a Linear Distance Relaxation","date":"2014-01-23","arxiv_id":"1401.6049","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-all-pairs-shortest-paths-by","title":"Computing All-Pairs Shortest Paths by Leveraging Low Treewidth","date":"2014-01-18","arxiv_id":"1401.4609","repositories_listed":0,"syntology":null},{"url":null,"slug":"counting-based-search-branching-heuristics","title":"Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems","date":"2014-01-18","arxiv_id":"1401.4601","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-local-search-for-solving-rcpspmax-with","title":"Robust Local Search for Solving RCPSP/max with Durational Uncertainty","date":"2014-01-18","arxiv_id":"1401.4595","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-line-planning-and-scheduling-an","title":"On-line Planning and Scheduling: An Application to Controlling Modular Printers","date":"2014-01-16","arxiv_id":"1401.3875","repositories_listed":0,"syntology":null},{"url":null,"slug":"scheduling-bipartite-tournaments-to-minimize","title":"Scheduling Bipartite Tournaments to Minimize Total Travel Distance","date":"2014-01-16","arxiv_id":"1401.3909","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-stochastic-resource-control-a","title":"Adaptive Stochastic Resource Control: A Machine Learning Approach","date":"2014-01-15","arxiv_id":"1401.3434","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounds-arc-consistency-for-weighted-csps","title":"Bounds Arc Consistency for Weighted CSPs","date":"2014-01-15","arxiv_id":"1401.3481","repositories_listed":0,"syntology":null},{"url":null,"slug":"intelligent-systems-for-information-security","title":"Intelligent Systems for Information Security","date":"2014-01-15","arxiv_id":"1401.3592","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-value-of-information-in-graphical","title":"Optimal Value of Information in Graphical Models","date":"2014-01-15","arxiv_id":"1401.3474","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-adaptive-simulated-annealing-based","title":"An adaptive Simulated Annealing-based satellite observation scheduling method combined with a dynamic task clustering strategy","date":"2014-01-14","arxiv_id":"1401.6098","repositories_listed":0,"syntology":null},{"url":null,"slug":"solver-scheduling-via-answer-set-programming","title":"Solver Scheduling via Answer Set Programming","date":"2014-01-06","arxiv_id":"1401.1024","repositories_listed":0,"syntology":null},{"url":null,"slug":"petuum-a-new-platform-for-distributed-machine","title":"Petuum: A New Platform for Distributed Machine Learning on Big Data","date":"2013-12-30","arxiv_id":"1312.7651","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-timescale-convergent-q-learning-for-sleep","title":"Two Timescale Convergent Q-learning for Sleep--Scheduling in Wireless Sensor Networks","date":"2013-12-27","arxiv_id":"1312.7292","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounded-recursive-self-improvement","title":"Bounded Recursive Self-Improvement","date":"2013-12-24","arxiv_id":"1312.6764","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-automated-reasoning-tools-from-black","title":"Hybrid Automated Reasoning Tools: from Black-box to Clear-box Integration","date":"2013-12-20","arxiv_id":"1312.6105","repositories_listed":0,"syntology":null},{"url":null,"slug":"planning-based-on-classification-by-induction","title":"Planning based on classification by induction graph","date":"2013-11-15","arxiv_id":"1311.3829","repositories_listed":0,"syntology":null},{"url":null,"slug":"anytime-belief-propagation-using-sparse","title":"Anytime Belief Propagation Using Sparse Domains","date":"2013-11-14","arxiv_id":"1311.3368","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterated-variable-neighborhood-search-for-the","title":"Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem","date":"2013-10-02","arxiv_id":"1310.0602","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tabu-search-algorithm-with-efficient","title":"A tabu search algorithm with efficient diversification strategy for high school timetabling problem","date":"2013-09-12","arxiv_id":"1309.3285","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-conflict-based-path-generation-heuristic","title":"A Conflict-Based Path-Generation Heuristic for Evacuation Planning","date":"2013-09-10","arxiv_id":"1309.2693","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-machine-scheduling-with-step","title":"Parallel machine scheduling with step deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm","date":"2013-09-02","arxiv_id":"1309.1453","repositories_listed":0,"syntology":null},{"url":null,"slug":"males-a-framework-for-automatic-tuning-of","title":"MaLeS: A Framework for Automatic Tuning of Automated Theorem Provers","date":"2013-08-09","arxiv_id":"1308.2116","repositories_listed":0,"syntology":null},{"url":null,"slug":"joshua-50-sparser-better-faster-server","title":"Joshua 5.0: Sparser, Better, Faster, Server","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"herding-the-crowd-automated-planning-for","title":"Herding the Crowd: Automated Planning for Crowdsourced Planning","date":"2013-07-29","arxiv_id":"1307.7720","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigation-of-enhancing-flexibility-and","title":"Investigation of \"Enhancing flexibility and robustness in multi-agent task scheduling\"","date":"2013-06-28","arxiv_id":"1307.0024","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-approach-for-the-containers-bin","title":"Evolutionary Approach for the Containers Bin-Packing Problem","date":"2013-06-03","arxiv_id":"1306.0442","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandits-with-knapsacks","title":"Bandits with Knapsacks","date":"2013-05-11","arxiv_id":"1305.2545","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-drift-analysis-and-generalized","title":"Combining Drift Analysis and Generalized Schema Theory to Design Efficient Hybrid and/or Mixed Strategy EAs","date":"2013-05-11","arxiv_id":"1305.2490","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimisation-for-job-scheduling-at-automated","title":"Optimisation for job scheduling at automated container terminals using genetic algorithm","date":"2013-05-11","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-metaheuristics-to-solve-mixed-shop","title":"A Novel Metaheuristics To Solve Mixed Shop Scheduling Problems","date":"2013-04-12","arxiv_id":"1304.3612","repositories_listed":0,"syntology":null},{"url":null,"slug":"logical-fuzzy-preferences","title":"Logical Fuzzy Preferences","date":"2013-04-05","arxiv_id":"1304.2797","repositories_listed":0,"syntology":null},{"url":null,"slug":"decision-theoretic-control-of-problem-solving","title":"Decision-Theoretic Control of Problem Solving: Principles and Architecture","date":"2013-03-27","arxiv_id":"1304.2343","repositories_listed":0,"syntology":null},{"url":null,"slug":"planning-scheduling-and-uncertainty-in-the","title":"Planning, Scheduling, and Uncertainty in the Sequence of Future Events","date":"2013-03-27","arxiv_id":"1304.3085","repositories_listed":0,"syntology":null},{"url":null,"slug":"update-report-leo-ii-version-15","title":"Update report: LEO-II version 1.5","date":"2013-03-15","arxiv_id":"1303.3761","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-scheduling-of-information-extraction","title":"Optimal Scheduling of Information Extraction Algorithms","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-online-em-for-big-topic-modeling","title":"Fast Online EM for Big Topic Modeling","date":"2012-10-08","arxiv_id":"1210.2179","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-data-collection-for-informative","title":"Optimal Data Collection For Informative Rankings Expose Well-Connected Graphs","date":"2012-07-26","arxiv_id":"1207.6430","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-polynomial-time-approximation-scheme-for-a","title":"A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm","date":"2012-02-08","arxiv_id":"1202.1708","repositories_listed":0,"syntology":null},{"url":null,"slug":"intelligent-unit-commitment-with-vehicle-to","title":"Intelligent unit commitment with vehicle-to-grid —A cost-emission optimization","date":"2010-02-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"6c2747a5713256a0cc016083bd3e42b2cb5d6dc17df18b8b643a440ccd48f039","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}