Filters








8 Hits in 10.1 sec

Beating the SDP bound for the floor layout problem: A simple combinatorial idea [article]

Joey Huchette, Santanu S. Dey, Juan Pablo Vielma
2017 arXiv   pre-print
We apply this technique to the one-dimensional and two-dimensional floor layout problems and compare it with the bounds generated by both state-of-the-art MIP solvers and by SDP relaxations.  ...  In this paper, we introduce an alternative bounding approach that exploits the "combinatorial implosion" effect by solving portions of the original problem and aggregating this information to obtain a  ...  Acknowledgements This material is based upon work supported by the National Science Foundation Graduate Research Fellowship under Grant No. 1122374 and Grant CMMI-1351619.  ... 
arXiv:1602.07802v2 fatcat:cgre74lfmvb4fiwtgajhmfd4ri

Beating the SDP bound for the floor layout problem: a simple combinatorial idea

Joey Huchette, Santanu S. Dey, Juan Pablo Vielma
2017 INFOR. Information systems and operational research  
We apply this technique to the one-dimensional and two-dimensional floor layout problems and compare it with the bounds generated by both state-of-the-art MIP solvers and by SDP relaxations.  ...  In this paper, we introduce an alternative bounding approach that exploits the "combinatorial implosion" effect by solving portions of the original problem and aggregating this information to obtain a  ...  Floor layout problem The floor layout problem (FLP), sometimes also known as the facility layout problem, is a difficult design problem traditionally arising in the arrangement of factory floors and, more  ... 
doi:10.1080/03155986.2017.1363592 fatcat:sczowvs4ubfkjapig2zafmjnzu

The single row facility layout problem: state of the art

Ravi Kothari, Diptesh Ghosh
2012 Quarterly Journal of the Operational Research Society of India (OPSEARCH)  
The single row facility layout problem (SRFLP) is a NP-hard problem concerned with the arrangement of facilities of given lengths on a line so as to minimize the weighted sum of the distances between all  ...  We provide exact and heuristic approaches that have been used to solve SRFLPs, and finally point out research gaps and promising directions for future research on this problem.  ...  Given a problem and an optimal solution to the problem, post-optimality analysis for combinatorial optimization problems answers questions about the robustness of the optimal solution.  ... 
doi:10.1007/s12597-012-0091-4 fatcat:hewlp4qv5fczpbvulfdxvbsko4

Design of large polyphase filters in the Quadratic Residue Number System

Gian Carlo Cardarilli, Alberto Nannarelli, Yann Oster, Massimo Petricca, Marco Re
2010 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers  
We provide a mapping which suggests that achieving certain DoF for the first problem provides a bandwidth bound for the second and under conditions vice versa.  ...  At each step of the proposed algorithm, an upper and a lower bound are computed for the optimal value of the underlying problem.  ... 
doi:10.1109/acssc.2010.5757589 fatcat:ccxnu5owr5fyrcjcqukumerueq

Metastability-containing circuits, parallel distance problems, and terrain guarding [article]

Stephan Friedrichs, Universität Des Saarlandes, Universität Des Saarlandes
2017
The second topic are parallel algorithms, based on an algebraic abstraction of the Moore-Bellman-Ford algorithm, for solving various distance problems.  ...  We propose a time-and value-discrete model for metastability in digital circuits and show that it reflects relevant physical properties.  ...  A famous example is the Art Gallery Problem (AGP), where one is given a 2D floor plan of a building, the art gallery, and looks for a minimum number of security cameras that together cover the entire gallery  ... 
doi:10.22028/d291-26788 fatcat:iymonuu53jacjaztfzqbzfm5jq

Dagstuhl Reports, Volume 6, Issue 11, November 2016, Complete Issue [article]

2017
The talk summarized the development of kernel methods for machine learning, focusing on the main ideas and some future possibilities: introduction of p.d. kernels within the theory of integral equations  ...  , their use in potential functions methods, in SVM, the general "kernel trick", the observation that kernels can be defined on arbitrary sets of objects, the link to GPs, and finally the idea to represent  ...  A goal is to discover conditional lower bounds for key problems for which little is currently known.  ... 
doi:10.4230/dagrep.6.11 fatcat:tfkdfittpjdydfv7ejvk4bvnh4

Formal Foundations for Networking (Dagstuhl Seminar 15071) Holistic Scene Understanding (Dagstuhl Seminar 15081) Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks (Dagstuhl Seminar 15082) Smart Buildings and Smart Grids (Dagstuhl Seminar 15091)

Sebastian Erdweg, Martin Erwig, Richard Paige, Eelco Visser, Nikolaj Bjørner, Nate Foster, Philip Godfrey, Pamela Zave, Yvonne Coady, James Kempf, Rick Mcgeer, Stefan Schmid (+12 others)
unpublished
Near-term research goals (2 years out): Scalable IP multicast that works for wide area (short-to-mid-term) Scalable and interoperable communication paths (  ...  We introduce a method for proving lower bounds on the size of SDP relaxations for combinatorial problems.  ...  Robinson on semialgebraic geometry of the set of matrices of psd rank at most k. We introduce a method for proving lower bounds on the size of SDP relaxations for combinatorial problems.  ... 
fatcat:sytmo76kmrb2jdk7za7ce7pwvm

Curious realism: Dada and Die neue Sachlichkeit in 1920s Karlsruhe

Shannon Connelly
2014
Where realism had traditionally demanded distance and observation—a sober, level head and a practiced hand—the Dadaist heritage called for a politics and a poetics of total immersion.  ...  It thus repositions a set of representational drawings, prints, photographs, and paintings that are usually valued for their fierce optical clarity, rather than for their emphatic, tactile made-ness.  ...  of photo layouts for book covers and magazines produced by the Malik Verlag in Berlin.  ... 
doi:10.7282/t3dv1h58 fatcat:pqrftuboczfffof52bgswq45uy