A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Privately Solving Linear Programs
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
Other Versions
For each class of linear programs we give an efficient, differentially private solver based on the multiplicative weights framework, or we give an impossibility result. ...
The first step is simply to define the problem: to this end, we introduce several natural classes of private linear programs that capture different ways sensitive data can be incorporated into a linear ...
(For example, many covering and packing LPs satisfy this property.) Suppose there are d sets, each covering some subset of m people. ...
doi:10.1007/978-3-662-43948-7_51
fatcat:n62o5yepl5dhfnojo2iq5litze
Randomized MWU for Positive LPs
[chapter]
2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We describe and analyze a simple randomized multiplicative weight update (MWU) based algorithm for approximately solving positive linear programming problems, in particular, mixed packing and covering ...
Given m explicit linear packing and covering constraints over n variables specified by N nonzero entries, Young [36] gave a deterministic algorithm returning an (1 + )-approximate feasible solution (if ...
Acknowledgments: CC thanks Jayram Thathachar and Jan Vondrák for discussions during their work on [8] . The deterministic version of rand-mwu is in the timed framework of that paper. ...
doi:10.1137/1.9781611975031.25
dblp:conf/soda/ChekuriQ18
fatcat:2ewothljzfet3k2gshhvpvzpbu
Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packing
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
As a key technical tool, we develop the first width-independent solvers for Schatten-p norm packing semidefinite programs, giving a (1 + ϵ)-approximate solution in O(plog(ndϵ)ϵ^-1) input-sparsity time ...
Our second, which attains a slightly worse approximation factor, runs in nearly-linear time and sample complexity under a mild spectral gap assumption. ...
Acknowledgments We thank Swati Padmanabhan and Aaron Sidford for helpful discussions. ...
arXiv:2006.06980v1
fatcat:eivg4rd2urhonblrmbjp2zif5u
An Optimized Multirobot Task Allocation
2008
2008 First International Conference on Emerging Trends in Engineering and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
phase using linear programming (LP). ...
This paper presents task allocation methodologies for MRS by considering their capability in terms of time and space. ...
In box-packing, objects are treated as rectangles which are packed into an open-ended bin of unit width and infinite height. ...
doi:10.1109/icetet.2008.111
dblp:conf/icetet/ChoudhuryB08
fatcat:wjuqosm56nectivvtkdl6t34fi
Development of a Novel Freight Railcar Load Planning and Monitoring System
2019
Symmetry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The analysis of the available loading software has led to the conclusion that no software offers adequate support to the planning and monitoring of the loading of goods into a covered railcar using a forklift ...
and monitoring software system. ...
Acknowledgments: The authors would like to pay their gratitude to Makso Đukić and his company SIGNALING DOO BELGRADE for providing support and donations. ...
doi:10.3390/sym11060756
fatcat:tyk5vziegrcp5pckwthwupgk6u
Survey on Combinatorial Register Allocation and Instruction Scheduling
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1409.7628v2 fatcat:qqapy7grojehjdiedv3acvrvdeOther Versions
compilation time. ...
Researchers in compilers and combinatorial optimization can benefit from identifying developments, trends, and challenges in the area; compiler practitioners may discern opportunities and grasp the potential ...
This work has been partially funded by Ericsson AB and the Swedish Research Council (VR) under grant 621-2011-6229. ...
arXiv:1409.7628v3
fatcat:ebbnooyzgbdvnaaqvtzpth7igi
Survey on Combinatorial Register Allocation and Instruction Scheduling
2019
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
compilation time. ...
Researchers in compilers and combinatorial optimization can benefit from identifying developments, trends, and challenges in the area; compiler practitioners may discern opportunities and grasp the potential ...
This work has been partially funded by Ericsson AB and the Swedish Research Council (VR) under grant 621-2011-6229. ...
doi:10.1145/3200920
fatcat:kb7z453cmjhbzjdxev6qmitqee
Discrete Optimization with Decision Diagrams
2016
INFORMS journal on computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Specific to the maximum cut problem, we tested the BDD-based solver on a classical benchmark set and identified tighter relaxation bounds than have ever been found by any technique, nearly closing the ...
W e propose a general branch-and-bound algorithm for discrete optimization in which binary decision diagrams (BDDs) play the role of the traditional linear programming relaxation. ...
Acknowledgments The authors acknowledge financial support from the National Science Foundation [NSF Grant 1130012] and the Air Force Office of Scientific Research [AFOSR Grant FA9550-11-1-0180]. ...
doi:10.1287/ijoc.2015.0648
fatcat:3bkm42hu3jagncfblzoz6hwlzq
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
2021
Mathematical Programming Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
and balancedness with respect to instance features and performance data. ...
A subset of 240 instances was specially selected for benchmarking solver performance. ...
as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. ...
doi:10.1007/s12532-020-00194-3
fatcat:btzgkrsmpvao7l4m4ydlwbzvru
Hybrid metaheuristics in combinatorial optimization: A survey
2011
Applied Soft Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
At the same time, the focus of research has changed from being rather algorithm-oriented to being more problem-oriented. ...
Hereby, hybridization is not restricted to the combination of different metaheuristics but includes, for example, the combination of exact algorithms and metaheuristics. ...
In IIRH the LP relaxation and the MIP relaxation are independent of each other. ...
doi:10.1016/j.asoc.2011.02.032
fatcat:zqdrzkmdlbcozin6isvt7pk3si
UCC
2007
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation - PLDI '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Therefore it is important to achieve energy efficiency in code dissemination. ...
Our experimental results show that they can achieve great improvements over the traditional, update-oblivious approaches. ...
Kim Hazelwood and anonymous reviewers for their insightful comments for improving the paper. We also thank Dr. Bruce Childers and Mr. Yu Du for the helpful discussions regarding this work. ...
doi:10.1145/1250734.1250778
dblp:conf/pldi/LiZYZ07
fatcat:kxnp7fm365e6hk7a4bbqvobm3a
UCC
2007
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Therefore it is important to achieve energy efficiency in code dissemination. ...
Our experimental results show that they can achieve great improvements over the traditional, update-oblivious approaches. ...
Kim Hazelwood and anonymous reviewers for their insightful comments for improving the paper. We also thank Dr. Bruce Childers and Mr. Yu Du for the helpful discussions regarding this work. ...
doi:10.1145/1273442.1250778
fatcat:lzpua2qeafckrb4qfrvopnn554
Principles of appendage design in robots and animals determining terradynamic performance on flowable ground
2015
Bioinspiration & Biomimetics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
and robot leg frequencies. ...
dry granular substrate could be widely and rapidly varied. ...
Acknowledgments We thank Madalyn Berns, Michael Wehner, Loretta K Lau and Jeffrey Shen for help with data collection. We thank Andrei Savu and Nick Gravish for help with the apparatus setup. ...
doi:10.1088/1748-3190/10/5/056014
pmid:26448267
fatcat:ggzfg7xgh5dyfmnymy5cwnu4va
Computer Simulation of High‐Frequency Electromagnetic Fields
[chapter]
2017
Computer Simulation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The code has friendly user interface, an advanced mesh generator, efficient solver and post-processor. ...
High-frequency and microwave electromagnetic fields are used in billions of various devices and systems. ...
Salimov and R.I. Tikhonov from the Russian R&D Centre LG Electronics Inc.
Author details
Andrey D. ...
doi:10.5772/67497
fatcat:wpre5y6r3bhnjbkbc24ioa6sxy
Algorithms for Floor Planning with Proximity Requirements
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The problem can be formulated as an integer linear program (ILP). ...
We formulate both subproblems as ILPs and solve realistic problem instances. Our experimental study shows that the problem helps to reduce the computation time considerably. ...
A linear program (LP) consists of (i) real-valued variables x 1 , . . . , x n , (ii) a target function that is restricted to be linear in the variables (e.g., minimize c 1 x 1 + · · · + c n x n for some ...
arXiv:2107.05036v1
fatcat:hsf3mi3zvvehnd4aurdy4n2jsi
« Previous
Showing results 1 — 15 out of 83 results