Filters








2,767 Hits in 4.1 sec

Balanced Crown Decomposition for Connectivity Constraints [article]

Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
2021 arXiv   pre-print
We introduce the balanced crown decomposition that captures the structure imposed on graphs by their connected induced subgraphs of a given size.  ...  The balanced crown decomposition is a combination of a crown decomposition and a balanced partition which makes it applicable to graph editing as well as graph packing and partitioning problems.  ...  Balanced Crown Decomposition (BCD): The main contribution of our paper is a new crown decomposition tailored for problems with connectivity constraints.  ... 
arXiv:2011.04528v3 fatcat:b6gcf4ehlrg5jgthyvciso3b2m

Balanced Crown Decomposition for Connectivity Constraints

Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif, Petra Mutzel, Rasmus Pagh, Grzegorz Herman
2021
We introduce the balanced crown decomposition that captures the structure imposed on graphs by their connected induced subgraphs of a given size.  ...  The balanced crown decomposition is a combination of a crown decomposition and a balanced partition which makes it applicable to graph editing as well as graph packing and partitioning problems.  ...  Balanced Crown Decomposition (BCD): The main contribution of our paper is a new crown decomposition tailored for problems with connectivity constraints.  ... 
doi:10.4230/lipics.esa.2021.26 fatcat:hymoymz2bjf2pfoal7eud2lrpm

ABC MODEL FOR ECONOMIC DEVELOPMENT OF A FIRM

Ana UŠPURIENĖ, Leonidas SAKALAUSKAS, Saverio GIULIANI, Carlo MELONI
2016 Technological and Economic Development of Economy  
The applications of the model developed to the hospital service and the Crown prosecution service are considered, too.  ...  The activity-based costing (ABC) in service companies is considered for minimization companies expenses modeling the uncertainty of service demand in the statistical probabilistic way.  ...  L-shaped decomposition method. 500 scenarios were generated for simulations.  ... 
doi:10.3846/20294913.2016.1190420 fatcat:pxl4r4axuvhmbmwxalb7mi6oxa

Hidden Convexities in Decentralized Coordination for the Distribution Networks

Pirathayini Srikantha, Mithun Mallick
2020 IEEE Transactions on Power Systems  
The main contribution of this work is the identification of hidden convexities in the original non-convex optimal power flow (OPF) formulation for the DN via strategic decomposition and strong duality  ...  These eliminate the need for OPF relaxations/approximations.  ...  This decomposition allocates two set of constraints for each agent where one constraint set is defined by a single non-convex constraint and the other is composed of convex constraints.  ... 
doi:10.1109/tpwrs.2020.2993453 fatcat:hhtpw2keljap5lilo24leuzm3e

Fast Crown Scheduling Heuristics for Energy-Efficient Mapping and Scaling of Moldable Streaming Tasks on Manycore Systems

Nicolas Melot, Christoph Kessler, Jörg Keller, Patrick Eitschberger
2015 ACM Transactions on Architecture and Code Optimization (TACO)  
heuristic for crown frequency scaling.  ...  in order to optimize energy efficiency given a throughput constraint.  ...  CROWN SCHEDULING A crown 2 is a recursive b-ary decomposition of the set of cores into subgroups down to singletons. These subgroups are to become the only possible mapping target for tasks.  ... 
doi:10.1145/2687653 fatcat:ui46eht4wbdwbb72ariyk4rhkm

Fast Crown Scheduling Heuristics for Energy-Efficient Mapping and Scaling of Moldable Streaming Tasks on Many-Core Systems

Nicolas Melot, Christoph Kessler, Jörg Keller, Patrick Eitschberger
2015 Proceedings of the 18th International Workshop on Software and Compilers for Embedded Systems - SCOPES '15  
heuristic for crown frequency scaling.  ...  in order to optimize energy efficiency given a throughput constraint.  ...  CROWN SCHEDULING A crown 2 is a recursive b-ary decomposition of the set of cores into subgroups down to singletons. These subgroups are to become the only possible mapping target for tasks.  ... 
doi:10.1145/2764967.2764975 dblp:conf/scopes/MelotK0E15 fatcat:u3gxpectozf6plldad75whvgua

Architectural Limitations in Multi-User Computer-Aided Engineering Applications

Edward Red, Greg Jensen, Prasad Weerakoon, David French, Steven Benzley, Karl Merkley
2013 Computer and Information Science  
Why have collaborative engineering CAx tools not been commercialized for mainstream use?  ...  This paper uses several multi-user prototypes, including the first Computer-Aided Engineering multi-user prototype called CUBIT Connect, to expose additional architectural hurdles to implementing new multi-user  ...  Acknowledgements The National Science Foundation, -CAx member companies, and BYU's -CAx research students are acknowledged for their funding and conducting of this research as a Center for e-Design Site  ... 
doi:10.5539/cis.v6n4p1 fatcat:bct3jaif7zflhmxy5r5zz3ioja

Optimal Decentralized Microgrid Coordination via the Schur's Complement and S-Procedure

Mithun Mallick, Pirathayini Srikantha
2019 IEEE Transactions on Smart Grid  
We account for the electrical dependencies and limits in microgrid systems by constructing voltage/current balance relations in the dq0 frame and applying strategic decompositions to invoke the Schur's  ...  complement and S-procedure that allow for zero duality gap.  ...  Decoupled Optimization Problem The decomposition of problem P C for each bus agent i is not straight-forward as constraints such as (C1) and (C4) are not separable.  ... 
doi:10.1109/tsg.2019.2922626 fatcat:bsfcu5vabvbmbfnn57gjfgsmlq

Crown Structures for Vertex Cover Kernelization

Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters
2007 Theory of Computing Systems  
Properties of crowns and methods for identifying them are discussed. Logical connections between linear programming and crown reductions are established.  ...  Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discussed.  ...  Acknowledgments We wish to thank Henning Fernau for many helpful discussions.  ... 
doi:10.1007/s00224-007-1328-0 fatcat:iiafgrkjybalppz26jmt7qmk3a

PRIMA: Precise and General Neural Network Certification via Multi-Neuron Convex Relaxations [article]

Mark Niklas Müller, Gleb Makarchuk, Gagandeep Singh, Markus Püschel, Martin Vechev
2021 arXiv   pre-print
Further, PRIMA enables, for the first time, precise verification of a realistic neural network for autonomous driving within a few minutes.  ...  The algorithms have polynomial complexity, yield fewer constraints, and minimize precision loss. We evaluate the effectiveness of PRIMA on a variety of challenging image classifiers from prior work.  ...  We evaluate our method on the MNIST dataset for normally trained, fully-connected and convolutional networks.  ... 
arXiv:2103.03638v2 fatcat:wzj6nxewb5dunehaxy4nwf2iaa

Multi-criteria optimization of concrete arch dams

M. Pouraminian, M. Ghaemian
2017 Scientia Iranica. International Journal of Science and Technology  
Pareto front method was used to balance both the economy and safety of the design simultaneously, which can be di cult for both analysts and decision-makers.  ...  These methods for the case of an arch dam are Lombardi coe cient and equilibrium point methods.  ...  Stress and geometric constraints are included as prerequisites for an optimal design in optimization process.  ... 
doi:10.24200/sci.2017.4272 fatcat:xi2cjw3zp5gwrghxrbjo6gf5qu

A Probabilistic Strategy for Setting Temporal Constraints in Scientific Workflows [chapter]

Xiao Liu, Jinjun Chen, Yun Yang
2008 Lecture Notes in Computer Science  
The strategy aims to effectively assign a set of temporal constraints which are well balanced between user requirements and system performance.  ...  To monitor and guarantee the correctness of temporal consistency, temporal constraints are often set and then verified.  ...  of linear culmination and decomposition.  ... 
doi:10.1007/978-3-540-85758-7_15 fatcat:uopk7pjgdfglxlrq5jagrtdeiu

Minimum near-convex decomposition for robust shape representation

Zhou Ren, Junsong Yuan, Chunyuan Li, Wenyu Liu
2011 2011 International Conference on Computer Vision  
Shape decomposition is a fundamental problem for partbased shape representation.  ...  We propose a novel shape decomposition method called Minimum Near-Convex Decomposition (MNCD), which decomposes 2D and 3D arbitrary shapes into minimum number of "near-convex" parts.  ...  For any two vertices p, q on the contour, if the line connecting p and q locates inside the shape, line pq is a cut. As shown in Fig.2(b) , the red lines are some sampled cuts.  ... 
doi:10.1109/iccv.2011.6126256 dblp:conf/iccv/RenYLL11 fatcat:2vlhscw4gncxjo3q2iggqjvioi

Modeling forest stand dynamics from optimal balances of carbon and nitrogen

Harry T. Valentine, Annikki Mäkelä
2012 New Phytologist  
Constraints on the optimization include pipe-model structure, the C cost of N acquisition, and agreement between the C and N balances.  ...  The latter is determined by two models of height growth rate, one derived from the C balance and the other from the N balance; agreement is defined by identical growth rates. • Predicted time-courses of  ...  Helmisaari for the data used in this article. We thank the referees for their thoughtful and useful reviews.  ... 
doi:10.1111/j.1469-8137.2012.04123.x pmid:22463713 fatcat:tks3nalu4na6neh6ptssnwklge

As-Continuous-As-Possible Extrusion Fabrication of Surface Models [article]

Fanchao Zhong and Yonglai Xu and Haisen Zhao and Lin Lu
2022 arXiv   pre-print
In this paper, we introduce an original criterion "one-path-patch" (OPP), for representing a shell surface patch that can be traversed in one path considering fabrication constraints.  ...  Furthermore, we customize the path planning algorithm with a curved layer printing scheme, which reduces the staircase defect and improves the toolpath continuity via possibly connecting multiple segments  ...  An automated pre-decomposition that balances the number of decomposed patches and path continuity is also a natural objective.  ... 
arXiv:2201.02374v3 fatcat:2jzegnj3yfdr3isgrqyja2rir4
« Previous Showing results 1 — 15 out of 2,767 results