{"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/combinatorial-optimization/papers/12","list_of":"/task/combinatorial-optimization","task":"Combinatorial Optimization","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":12,"pages_in_order":13,"rows_per_page":100,"rows":[1101,1200],"of":1277,"counts":{"archive_papers_tagged":1277,"with_a_code_link":401,"where_syntology_ran_a_sample":122,"not_listed_spam_title":0,"listed":1277,"listed_where_code_ran":122,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":105,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":105,"listed_every_run_a_failure_of_syntologys_instrument":17,"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/combinatorial-optimization","prev":"/task/combinatorial-optimization/papers/11","next":"/task/combinatorial-optimization/papers/13","papers":[{"url":null,"slug":"quit-when-you-can-efficient-evaluation-of","title":"Quit When You Can: Efficient Evaluation of Ensembles with Ordering Optimization","date":"2018-06-28","arxiv_id":"1806.11202","repositories_listed":0,"syntology":null},{"url":"/paper/deep-learning-of-graph-matching","slug":"deep-learning-of-graph-matching","title":"Deep Learning of Graph Matching","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ingeotec-at-semeval-2018-task-1-evomsa-and","title":"INGEOTEC at SemEval-2018 Task 1: EvoMSA and μTC for Sentiment Analysis","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generic-cp-supported-cmsa-for-binary-integer","title":"Generic CP-Supported CMSA for Binary Integer Linear Programs","date":"2018-05-30","arxiv_id":"1805.11820","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-channel-pruning-method-for-deep","title":"A novel channel pruning method for deep neural network compression","date":"2018-05-29","arxiv_id":"1805.11394","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-element-screening-for-submodular","title":"Safe Element Screening for Submodular Function Minimization","date":"2018-05-22","arxiv_id":"1805.08527","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-rl-for-container-loading","title":"Evolutionary RL for Container Loading","date":"2018-05-17","arxiv_id":"1805.06664","repositories_listed":0,"syntology":null},{"url":null,"slug":"recent-progress-on-graph-partitioning","title":"Recent Progress on Graph Partitioning Problems Using Evolutionary Computation","date":"2018-05-04","arxiv_id":"1805.01623","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-task-selected-learning-approach-for","title":"A Multi-task Selected Learning Approach for Solving 3D Flexible Bin Packing Problem","date":"2018-04-17","arxiv_id":"1804.06896","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-greedy-column-subset-selection","title":"Regularized Greedy Column Subset Selection","date":"2018-04-12","arxiv_id":"1804.04421","repositories_listed":0,"syntology":null},{"url":null,"slug":"composing-photomosaic-images-using-clustering","title":"Composing photomosaic images using clustering based evolutionary programming","date":"2018-04-09","arxiv_id":"1804.02827","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-e-commerce-search-engine-ranking","title":"Accelerating E-Commerce Search Engine Ranking by Contextual Factor Selection","date":"2018-03-14","arxiv_id":"1803.00693","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothed-analysis-for-low-rank-solutions-to","title":"Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form","date":"2018-03-01","arxiv_id":"1803.00186","repositories_listed":0,"syntology":null},{"url":null,"slug":"cakewalk-sampling","title":"Cakewalk Sampling","date":"2018-02-25","arxiv_id":"1802.09030","repositories_listed":0,"syntology":null},{"url":null,"slug":"memcomputing-leveraging-memory-and-physics-to","title":"Memcomputing: Leveraging memory and physics to compute efficiently","date":"2018-02-20","arxiv_id":"1802.06928","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-methods-for-solving","title":"Machine Learning Methods for Data Association in Multi-Object Tracking","date":"2018-02-19","arxiv_id":"1802.06897","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrepancy-based-evolutionary-diversity","title":"Discrepancy-based Evolutionary Diversity Optimization","date":"2018-02-15","arxiv_id":"1802.05448","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph2seq-scalable-learning-dynamics-for","title":"Graph2Seq: Scalable Learning Dynamics for Graphs","date":"2018-02-14","arxiv_id":"1802.04948","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-can-l_p-norm-objective-functions-be","title":"When can $l_p$-norm objective functions be minimized via graph cuts?","date":"2018-02-02","arxiv_id":"1802.00624","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatial-field-reconstruction-and-sensor","title":"Spatial Field Reconstruction and Sensor Selection in Heterogeneous Sensor Networks with Stochastic Energy Harvesting","date":"2018-01-16","arxiv_id":"1801.05356","repositories_listed":0,"syntology":null},{"url":null,"slug":"long-term-memory-network-for-combinatorial","title":"Long Term Memory Network for Combinatorial Optimization Problems","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluation-of-bioinspired-algorithms-for-the","title":"Evaluation of bioinspired algorithms for the solution of the job scheduling problem","date":"2017-11-21","arxiv_id":"1711.07821","repositories_listed":0,"syntology":null},{"url":null,"slug":"maximizing-non-monotonenon-submodular","title":"Maximizing Submodular or Monotone Approximately Submodular Functions by Multi-objective Evolutionary Algorithms","date":"2017-11-20","arxiv_id":"1711.07214","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-relaxations-of-sparse-packing","title":"Scalable Relaxations of Sparse Packing Constraints: Optimal Biocontrol in Predator-Prey Network","date":"2017-11-18","arxiv_id":"1711.06800","repositories_listed":0,"syntology":null},{"url":null,"slug":"sensor-selection-and-random-field","title":"Sensor Selection and Random Field Reconstruction for Robust and Cost-effective Heterogeneous Weather Sensor Networks for the Developing World","date":"2017-11-12","arxiv_id":"1711.04308","repositories_listed":0,"syntology":null},{"url":null,"slug":"reparameterizing-the-birkhoff-polytope-for","title":"Reparameterizing the Birkhoff Polytope for Variational Permutation Inference","date":"2017-10-26","arxiv_id":"1710.09508","repositories_listed":0,"syntology":null},{"url":null,"slug":"eb-gls-an-improved-guided-local-search-based","title":"EB-GLS: An Improved Guided Local Search Based on the Big Valley Structure","date":"2017-09-22","arxiv_id":"1709.07576","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-in-graphical-models-via","title":"Inference in Graphical Models via Semidefinite Programming Hierarchies","date":"2017-09-19","arxiv_id":"1709.06525","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-a-new-3d-bin-packing-problem-with","title":"Solving a New 3D Bin Packing Problem with Deep Reinforcement Learning Method","date":"2017-08-20","arxiv_id":"1708.05930","repositories_listed":0,"syntology":null},{"url":null,"slug":"ingeotec-at-semeval-2017-task-4-a-b4msa","title":"INGEOTEC at SemEval 2017 Task 4: A B4MSA Ensemble based on Genetic Programming for Twitter Sentiment Analysis","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-graph-decomposition-node-labeling","title":"Joint Graph Decomposition & Node Labeling: Problem, Algorithms, Applications","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"protein-design-by-multiobjective-optimization","title":"Protein design by multiobjective optimization: evolutionary and non-evolutionary approaches","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-dependency-parsing-via-book","title":"Semantic Dependency Parsing via Book Embedding","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"population-specific-design-of-de-immunized","title":"Population-specific design of de-immunized protein biotherapeutics","date":"2017-06-28","arxiv_id":"1706.09083","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommendations-for-marketing-campaigns-in","title":"Recommendations for Marketing Campaigns in Telecommunication Business based on the footprint analysis","date":"2017-06-13","arxiv_id":"1706.03944","repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-planning-of-fixed-millimeter-wave","title":"End-to-end Planning of Fixed Millimeter-Wave Networks","date":"2017-05-20","arxiv_id":"1705.07249","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-clustering-objective-functions","title":"Hierarchical Clustering: Objective Functions and Algorithms","date":"2017-04-07","arxiv_id":"1704.02147","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-branch-and-bound-algorithm-for-checkerboard","title":"A Branch-and-Bound Algorithm for Checkerboard Extraction in Camera-Laser Calibration","date":"2017-04-04","arxiv_id":"1704.00887","repositories_listed":0,"syntology":null},{"url":null,"slug":"experimental-analysis-of-design-elements-of","title":"Experimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms","date":"2017-03-28","arxiv_id":"1703.09469","repositories_listed":0,"syntology":null},{"url":null,"slug":"metodos-de-otimizacao-combinatoria-aplicados","title":"Métodos de Otimização Combinatória Aplicados ao Problema de Compressão MultiFrases","date":"2017-03-19","arxiv_id":"1703.06501","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-approximation-guarantees-for-greedy-low","title":"On Approximation Guarantees for Greedy Low Rank Optimization","date":"2017-03-08","arxiv_id":"1703.02721","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-knowledge-based-approach-to-word-sense","title":"A Knowledge-Based Approach to Word Sense Disambiguation by distributional selection and semantic features","date":"2017-02-27","arxiv_id":"1702.08450","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-bounds-for-bandit-combinatorial","title":"Tight Bounds for Bandit Combinatorial Optimization","date":"2017-02-24","arxiv_id":"1702.07539","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-evolutionary-algorithm-based-on","title":"A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem","date":"2017-02-01","arxiv_id":"1702.00318","repositories_listed":0,"syntology":null},{"url":null,"slug":"shape-estimation-from-defocus-cue-for","title":"Shape Estimation from Defocus Cue for Microscopy Images via Belief Propagation","date":"2016-12-30","arxiv_id":"1612.09411","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-combinatorial-optimization-problems","title":"Solving Combinatorial Optimization problems with Quantum inspired Evolutionary Algorithm Tuned using a Novel Heuristic Method","date":"2016-12-23","arxiv_id":"1612.08109","repositories_listed":0,"syntology":null},{"url":null,"slug":"maximizing-non-monotone-dr-submodular","title":"Maximizing Non-Monotone DR-Submodular Functions with Cardinality Constraints","date":"2016-11-29","arxiv_id":"1611.09474","repositories_listed":0,"syntology":null},{"url":null,"slug":"recursive-decomposition-for-nonconvex","title":"Recursive Decomposition for Nonconvex Optimization","date":"2016-11-08","arxiv_id":"1611.02755","repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristic-with-elements-of-tabu-search-for","title":"Heuristic with elements of tabu search for Truck and Trailer Routing Problem","date":"2016-09-29","arxiv_id":"1609.09253","repositories_listed":0,"syntology":null},{"url":null,"slug":"duality-between-feature-selection-and-data","title":"Duality between Feature Selection and Data Clustering","date":"2016-09-27","arxiv_id":"1609.08312","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-mathematical-relationship-between","title":"On the Mathematical Relationship between Expected n-call@k and the Relevance vs. Diversity Trade-off","date":"2016-09-21","arxiv_id":"1609.06568","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tutorial-about-random-neural-networks-in","title":"A Tutorial about Random Neural Networks in Supervised Learning","date":"2016-09-15","arxiv_id":"1609.04846","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generic-bet-and-run-strategy-for-speeding","title":"A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover","date":"2016-09-13","arxiv_id":"1609.03993","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-case-study-of-algorithm-selection-for-the","title":"A case study of algorithm selection for the traveling thief problem","date":"2016-09-02","arxiv_id":"1609.00462","repositories_listed":0,"syntology":null},{"url":null,"slug":"mindx-denoising-mixed-impulse-poisson","title":"MindX: Denoising Mixed Impulse Poisson-Gaussian Noise Using Proximal Algorithms","date":"2016-08-28","arxiv_id":"1608.07802","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-learning-for-log-supermodular","title":"Parameter Learning for Log-supermodular Distributions","date":"2016-08-18","arxiv_id":"1608.05258","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-calculate-partition-functions-using","title":"How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods","date":"2016-07-11","arxiv_id":"1607.03183","repositories_listed":0,"syntology":null},{"url":null,"slug":"pruning-random-forests-for-prediction-on-a","title":"Pruning Random Forests for Prediction on a Budget","date":"2016-06-16","arxiv_id":"1606.05060","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-complexity-of-automated-mechanism","title":"Sample Complexity of Automated Mechanism Design","date":"2016-06-13","arxiv_id":"1606.04145","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-performance-of-different-mutation","title":"On the performance of different mutation operators of a subpopulation-based genetic algorithm for multi-robot task allocation problems","date":"2016-06-02","arxiv_id":"1606.00601","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-perturb-and-map-for-structured","title":"Local Perturb-and-MAP for Structured Prediction","date":"2016-05-24","arxiv_id":"1605.07686","repositories_listed":0,"syntology":null},{"url":null,"slug":"support-vector-algorithms-for-optimizing-the","title":"Support Vector Algorithms for Optimizing the Partial Area Under the ROC Curve","date":"2016-05-13","arxiv_id":"1605.04337","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-key-cuckoo-search-for-the-travelling","title":"Random-Key Cuckoo Search for the Travelling Salesman Problem","date":"2016-04-14","arxiv_id":"1607.04324","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-topic-models-using-small","title":"Combinatorial Topic Models using Small-Variance Asymptotics","date":"2016-04-07","arxiv_id":"1604.02027","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-optimization-problems-by-the-public","title":"Solving Optimization Problems by the Public Goods Game","date":"2016-04-07","arxiv_id":"1604.02929","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-based-local-search-for","title":"Reinforcement learning based local search for grouping problems: A case study on graph coloring","date":"2016-04-01","arxiv_id":"1604.00377","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-super-resolution-based-on-sparsity","title":"Image Super-Resolution Based on Sparsity Prior via Smoothed $l_0$ Norm","date":"2016-03-22","arxiv_id":"1603.06680","repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-algorithms-for-news-and-scientific","title":"Streaming Algorithms for News and Scientific Literature Recommendation: Submodular Maximization with a d-Knapsack Constraint","date":"2016-03-17","arxiv_id":"1603.05614","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-evolutionary-strategy-based-on-partial","title":"An Evolutionary Strategy based on Partial Imitation for Solving Optimization Problems","date":"2016-02-12","arxiv_id":"1602.04186","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-algorithms-for-adversarial","title":"Efficient Algorithms for Adversarial Contextual Learning","date":"2016-02-08","arxiv_id":"1602.02454","repositories_listed":0,"syntology":null},{"url":null,"slug":"mapping-tractography-across-subjects","title":"Mapping Tractography Across Subjects","date":"2016-01-29","arxiv_id":"1601.08165","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-computationally-tractable-selection-of","title":"On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models","date":"2016-01-09","arxiv_id":"1601.02068","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-integrated-glance-to-restructuring-in","title":"Towards Integrated Glance To Restructuring in Combinatorial Optimization","date":"2015-12-20","arxiv_id":"1512.06427","repositories_listed":0,"syntology":null},{"url":null,"slug":"level-based-analysis-of-genetic-algorithms","title":"Level-Based Analysis of Genetic Algorithms for Combinatorial Optimization","date":"2015-12-07","arxiv_id":"1512.02047","repositories_listed":0,"syntology":null},{"url":null,"slug":"smooth-and-strong-map-inference-with-linear","title":"Smooth and Strong: MAP Inference with Linear Convergence","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-online-greedy-learning-with-semi","title":"Stochastic Online Greedy Learning with Semi-bandit Feedbacks","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"moead-gm-using-probabilistic-graphical-models","title":"MOEA/D-GM: Using probabilistic graphical models in MOEA/D for solving combinatorial optimization problems","date":"2015-11-18","arxiv_id":"1511.05625","repositories_listed":0,"syntology":null},{"url":null,"slug":"submodular-functions-from-discrete-to","title":"Submodular Functions: from Discrete to Continous Domains","date":"2015-11-02","arxiv_id":"1511.00394","repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-distributed-variational-inference","title":"Streaming, Distributed Variational Inference for Bayesian Nonparametrics","date":"2015-10-30","arxiv_id":"1510.09161","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-based-compressive-subsampling","title":"Learning-based Compressive Subsampling","date":"2015-10-21","arxiv_id":"1510.06188","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularization-vs-relaxation-a-conic","title":"Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection","date":"2015-10-20","arxiv_id":"1510.06083","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimum-weight-perfect-matching-via-blossom","title":"Minimum Weight Perfect Matching via Blossom Belief Propagation","date":"2015-09-23","arxiv_id":"1509.06849","repositories_listed":0,"syntology":null},{"url":null,"slug":"hardness-of-online-sleeping-combinatorial","title":"Hardness of Online Sleeping Combinatorial Optimization Problems","date":"2015-09-11","arxiv_id":"1509.03600","repositories_listed":0,"syntology":null},{"url":null,"slug":"concept-based-summarization-using-integer","title":"Concept-based Summarization using Integer Linear Programming: From Concept Pruning to Multiple Optimal Solutions","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"message-passing-and-combinatorial","title":"Message Passing and Combinatorial Optimization","date":"2015-08-20","arxiv_id":"1508.05013","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-backtracking-survey-propagation-algorithm","title":"The backtracking survey propagation algorithm for solving random K-SAT problems","date":"2015-08-20","arxiv_id":"1508.05117","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-framework-for-local-calibration-of","title":"A Bayesian framework for functional calibration of expensive computational models through non-isometric matching","date":"2015-08-05","arxiv_id":"1508.01240","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-inverse-problems-with-norm-and","title":"Linear Inverse Problems with Norm and Sparsity Constraints","date":"2015-07-20","arxiv_id":"1507.05370","repositories_listed":0,"syntology":null},{"url":null,"slug":"artificial-catalytic-reactions-in-2d-for","title":"Artificial Catalytic Reactions in 2D for Combinatorial Optimization","date":"2015-06-30","arxiv_id":"1506.09019","repositories_listed":0,"syntology":null},{"url":null,"slug":"gaze-enabled-egocentric-video-summarization","title":"Gaze-Enabled Egocentric Video Summarization via Constrained Submodular Maximization","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-propose-objects","title":"Learning to Propose Objects","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-projective-dependency-based-pre-1","title":"Non-projective Dependency-based Pre-Reordering with Recurrent Neural Network for Machine Translation","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-combinatorial-clustering-preliminary","title":"Towards combinatorial clustering: preliminary research survey","date":"2015-05-28","arxiv_id":"1505.07872","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dynamic-programming-algorithm-for-tree","title":"A Dynamic Programming Algorithm for Tree Trimming-based Text Summarization","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-optimal-quadratic-approach-to-monolingual","title":"An Optimal Quadratic Approach to Monolingual Paraphrase Alignment","date":"2015-05-01","arxiv_id":null,"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":"tight-bounds-on-low-degree-spectral","title":"Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions","date":"2015-04-13","arxiv_id":"1504.03391","repositories_listed":0,"syntology":null},{"url":null,"slug":"totally-corrective-boosting-with-cardinality","title":"Totally Corrective Boosting with Cardinality Penalization","date":"2015-04-07","arxiv_id":"1504.01446","repositories_listed":0,"syntology":null},{"url":null,"slug":"feeder-load-balancing-using-neural-network","title":"Feeder Load Balancing using Neural Network","date":"2015-03-20","arxiv_id":"1503.06004","repositories_listed":0,"syntology":null},{"url":null,"slug":"importance-weighting-without-importance","title":"Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits","date":"2015-03-17","arxiv_id":"1503.05087","repositories_listed":0,"syntology":null}],"record_sha256":"ac1eb26262b025bcce85b9686974d64ca9d69ce81ee8cc13c81f5a35fba075df","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}