Добірка наукової літератури з теми "Matroid Constraints"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Matroid Constraints".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Matroid Constraints"
Dror, Amitay, Michal Feldman, and Erel Segal-Halevi. "On Fair Division under Heterogeneous Matroid Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 6 (May 18, 2021): 5312–20. http://dx.doi.org/10.1609/aaai.v35i6.16670.
Повний текст джерелаKamiyama, Naoyuki. "MATROID INTERSECTION WITH PRIORITY CONSTRAINTS." Journal of the Operations Research Society of Japan 56, no. 1 (2013): 15–25. http://dx.doi.org/10.15807/jorsj.56.15.
Повний текст джерелаFriedrich, Tobias, and Frank Neumann. "Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms." Evolutionary Computation 23, no. 4 (December 2015): 543–58. http://dx.doi.org/10.1162/evco_a_00159.
Повний текст джерелаDo, Anh Viet, and Frank Neumann. "Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 14 (May 18, 2021): 12284–92. http://dx.doi.org/10.1609/aaai.v35i14.17458.
Повний текст джерелаBiswas, Arpita, and Siddharth Barman. "Matroid Constrained Fair Allocation Problem." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 9921–22. http://dx.doi.org/10.1609/aaai.v33i01.33019921.
Повний текст джерелаGu, Yu-Ran, Chao Bian, and Chao Qian. "Submodular Maximization under the Intersection of Matroid and Knapsack Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 4 (June 26, 2023): 3959–67. http://dx.doi.org/10.1609/aaai.v37i4.25510.
Повний текст джерелаSuksompong, Warut. "Constraints in fair division." ACM SIGecom Exchanges 19, no. 2 (November 2021): 46–61. http://dx.doi.org/10.1145/3505156.3505162.
Повний текст джерелаKirály, Csaba, Zoltán Szigeti, and Shin-ichi Tanigawa. "Packing of arborescences with matroid constraints via matroid intersection." Mathematical Programming 181, no. 1 (April 2, 2019): 85–117. http://dx.doi.org/10.1007/s10107-019-01377-0.
Повний текст джерелаSrinivas, Mandayam A. "Matroid optimization with generalized constraints." Discrete Applied Mathematics 63, no. 2 (November 1995): 161–74. http://dx.doi.org/10.1016/0166-218x(94)00031-8.
Повний текст джерелаRamalingam, Srikumar, Arvind Raghunathan, and Daniel Nikovski. "Submodular Function Maximization for Group Elevator Scheduling." Proceedings of the International Conference on Automated Planning and Scheduling 27 (June 5, 2017): 233–41. http://dx.doi.org/10.1609/icaps.v27i1.13799.
Повний текст джерелаДисертації з теми "Matroid Constraints"
Reimers, Arne Cornelis [Verfasser]. "Metabolic Networks, Thermodynamic Constraints, and Matroid Theory / Arne C. Reimers." Berlin : Freie Universität Berlin, 2014. http://d-nb.info/1058587331/34.
Повний текст джерелаHarini, Desiraju Harini. "Matrix models and Virasoro constraints." Thesis, Uppsala universitet, Teoretisk fysik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-276090.
Повний текст джерелаFlieger, Wojciech. "Constraints on neutrino mixing from matrix theory." Doctoral thesis, Katowice : Uniwersytet Śląski, 2021. http://hdl.handle.net/20.500.12128/21721.
Повний текст джерелаLecharlier, Loïc. "Blind inverse imaging with positivity constraints." Doctoral thesis, Universite Libre de Bruxelles, 2014. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209240.
Повний текст джерелаDoctorat en Sciences
info:eu-repo/semantics/nonPublished
Strabic, Natasa. "Theory and algorithms for matrix problems with positive semidefinite constraints." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/theory-and-algorithms-for-matrix-problems-with-positive-semidefinite-constraints(5c8ac15f-9666-4682-9297-73d976bed63e).html.
Повний текст джерелаChia, Liang. "Language shift in a Singaporean Chinese family and the matrix language frame model." Thesis, University of Oxford, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365765.
Повний текст джерелаXu, Da. "Classical groups, integrals and Virasoro constraints." Diss., University of Iowa, 2010. https://ir.uiowa.edu/etd/629.
Повний текст джерелаBai, Shuanghua. "Numerical methods for constrained Euclidean distance matrix optimization." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/401542/.
Повний текст джерелаJin, Shengzhe. "Quality Assessment Planning Using Design Structure Matrix and Resource Constraint Analysis." University of Cincinnati / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1292518039.
Повний текст джерелаMenzel, Andreas. "Constraints on the Fourth-Generation Quark Mixing Matrix from Precision Flavour Observables." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät, 2017. http://dx.doi.org/10.18452/17711.
Повний текст джерелаThe Standard Model extended by an additional sequential generation of Dirac fermions (SM4) was excluded with a significance of 5.3 sigma in 2012. This was achieved in a combined fit of the SM4 to Electroweak Precision Observables and signal strengths of the Higgs boson. This thesis complements this excludion by a fit of the SM4 to a typical set of Flavour physics observables and the results of the previously performed Electroweak Precision fit. Quantities extracted in an SM3 framework are reinterpreted in SM4 terms and the adapted theoretical expressions are given. The resultant constraints on the SM4''s CKM matrix, its potentially CP-violating phases and the mass of the new up-type quark t'' are given. To compare the relative performance of the SM4 and the SM3, this work uses the chi^2 values achieved in the fit. The values of 15.53 for the SM4 and 9.56 for the SM4 are almost perfectly consistent with both models describing the experimental data equally well with the SM3 having six degrees of freedom more. The dimuon charge asymmetry ASL was not used as a fit input because the interpretation of its measurement was subject to debate at the time when the fits were produced, but its prediction in the fit was used as an additional test of the SM4. The SM3''s prediction differs from the experimental values by about 2 sigma, and the SM4''s prediction by about 3 sigma. \par In summary, these results do not suggest that any significant reduction of the 5.3 sigma exclusion could be achieved by combining the Electroweak Precision Observables and Higgs inputs with Flavour physics data. However, the exact effect of the Flavour physics input on the significance of the SM4''s exclusion cannot be given at this point because the CKMfitter software is currently not able to perform a statistically stringent likelihood comparison of non-nested models.
Книги з теми "Matroid Constraints"
C, Chamis C., and United States. National Aeronautics and Space Administration., eds. Composite laminate tailoring with probabilistic constraints and loads. [Washington, D.C.]: NASA, 1990.
Знайти повний текст джерелаLi, Huacheng. Estimation of Q-matrix for DINA Model Using the Constrained Generalized DINA Framework. [New York, N.Y.?]: [publisher not identified], 2016.
Знайти повний текст джерелаCoolen, A. C. C., A. Annibale, and E. S. Roberts. Soft constraints: exponential random graph models. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0004.
Повний текст джерелаIts, Alexander R. Random matrix theory and integrable systems. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.10.
Повний текст джерелаBeenakker, Carlo W. J. Extreme eigenvalues of Wishart matrices: application to entangled bipartite system. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.37.
Повний текст джерелаHu, Xuhui. The syntax and semantics of English resultatives. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198808466.003.0003.
Повний текст джерелаHu, Xuhui. Encoding applied arguments. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198808466.003.0006.
Повний текст джерелаFrascarelli, Mara. The interpretation of pro in consistent and partial null-subject languages. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198815853.003.0009.
Повний текст джерелаRonen, Boaz, Joseph S. Pliskin, Shimeon Pass, and Donald M. Berwick. The Hospital and Clinic Improvement Handbook. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780190843458.001.0001.
Повний текст джерелаJohnston, Ron. Geography and International Studies: The Foundations. Oxford University Press, 2017. http://dx.doi.org/10.1093/acrefore/9780190846626.013.199.
Повний текст джерелаЧастини книг з теми "Matroid Constraints"
Benabbou, Nawal, Cassandre Leroy, Thibaut Lust, and Patrice Perny. "Interactive Optimization of Submodular Functions Under Matroid Constraints." In Algorithmic Decision Theory, 307–22. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87756-9_20.
Повний текст джерелаHenzinger, Monika, and Angelina Vidali. "Multi-parameter Mechanism Design under Budget and Matroid Constraints." In Algorithms – ESA 2011, 192–202. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23719-5_17.
Повний текст джерелаKamiyama, Naoyuki. "The Popular Matching and Condensation Problems Under Matroid Constraints." In Combinatorial Optimization and Applications, 713–28. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12691-3_53.
Повний текст джерелаLiu, Zhicheng, Jing Jin, Donglei Du, and Xiaoyan Zhang. "Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints." In Lecture Notes in Computer Science, 140–54. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-20350-3_13.
Повний текст джерелаKamiyama, Naoyuki. "Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints." In Algorithmic Game Theory, 3–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48433-3_1.
Повний текст джерелаIwamasa, Yuni, and Kenjiro Takazawa. "Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications." In Lecture Notes in Computer Science, 156–67. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59267-7_14.
Повний текст джерелаvan Bevern, René, Oxana Yu Tsidulko, and Philipp Zschoche. "Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints." In Lecture Notes in Computer Science, 62–74. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-17402-6_6.
Повний текст джерелаFriedrich, Tobias, and Frank Neumann. "Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms." In Parallel Problem Solving from Nature – PPSN XIII, 922–31. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10762-2_91.
Повний текст джерелаBuchbinder, Niv, Joseph Naor, R. Ravi, and Mohit Singh. "Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints." In Automata, Languages, and Programming, 145–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31594-7_13.
Повний текст джерелаDo, Anh Viet, and Frank Neumann. "Maximizing Submodular or Monotone Functions Under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms." In Parallel Problem Solving from Nature – PPSN XVI, 588–603. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58115-2_41.
Повний текст джерелаТези доповідей конференцій з теми "Matroid Constraints"
Madan, Vivek, Aleksandar Nikolov, Mohit Singh, and Uthaipon Tantipongpipat. "Maximizing Determinants under Matroid Constraints." In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2020. http://dx.doi.org/10.1109/focs46700.2020.00059.
Повний текст джерелаAbbassi, Zeinab, Vahab S. Mirrokni, and Mayur Thakur. "Diversity maximization under matroid constraints." In KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, NY, USA: ACM, 2013. http://dx.doi.org/10.1145/2487575.2487636.
Повний текст джерелаCeccarello, Matteo, Andrea Pietracaprina, and Geppino Pucci. "Fast Coreset-based Diversity Maximization under Matroid Constraints." In WSDM 2018: The Eleventh ACM International Conference on Web Search and Data Mining. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3159652.3159719.
Повний текст джерелаClark, Andrew, Basel Alomair, Linda Bushnell, and Radha Poovendran. "Scalable and distributed submodular maximization with matroid constraints." In 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt). IEEE, 2015. http://dx.doi.org/10.1109/wiopt.2015.7151103.
Повний текст джерелаLee, Jon, Vahab S. Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko. "Non-monotone submodular maximization under matroid and knapsack constraints." In the 41st annual ACM symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1536414.1536459.
Повний текст джерелаEne, Alina, Huy L. Nguyễn, and Adrian Vladu. "Submodular maximization with matroid and packing constraints in parallel." In STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3313276.3316389.
Повний текст джерелаWilliams, Ryan K., Andrea Gasparri, and Giovanni Ulivi. "Decentralized matroid optimization for topology constraints in multi-robot allocation problems." In 2017 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2017. http://dx.doi.org/10.1109/icra.2017.7989038.
Повний текст джерелаWu, Benwei, and Kai Han. "Fast Algorithm for Big Data Summarization with Knapsack and Partition Matroid Constraints." In 2022 International Conference on INnovations in Intelligent SysTems and Applications (INISTA). IEEE, 2022. http://dx.doi.org/10.1109/inista55318.2022.9894252.
Повний текст джерелаKawase, Yasushi, Hanna Sumita, and Yu Yokoi. "Random Assignment of Indivisible Goods under Constraints." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/311.
Повний текст джерелаBiswas, Arpita, and Siddharth Barman. "Fair Division Under Cardinality Constraints." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/13.
Повний текст джерелаЗвіти організацій з теми "Matroid Constraints"
Heinstein, M. W. An algorithm for enforcement of contact constraints in quasistatic applications using matrix-free solution algorithms. Office of Scientific and Technical Information (OSTI), October 1997. http://dx.doi.org/10.2172/554827.
Повний текст джерелаHeinkenschloss, Matthias, Denis Ridzal, and Miguel Antonio Aguilo. Numerical study of a matrix-free trust-region SQP method for equality constrained optimization. Office of Scientific and Technical Information (OSTI), December 2011. http://dx.doi.org/10.2172/1038211.
Повний текст джерелаCarvalho, Joana, and Gerardo Reyes-Tagle. Risk Matrix and PPP Contract Standardization, Best Practice, and Gap Analysis in Brazil. Inter-American Development Bank, April 2022. http://dx.doi.org/10.18235/0004213.
Повний текст джерелаBrenan, J. M., K. Woods, J. E. Mungall, and R. Weston. Origin of chromitites in the Esker Intrusive Complex, Ring of Fire Intrusive Suite, as revealed by chromite trace element chemistry and simple crystallization models. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/328981.
Повний текст джерелаHIGH PRECISION IDENTIFICATION METHOD OF MASS AND STIFFNESS MATRIX FOR SHEAR-TYPE FRAME TEST MODEL. The Hong Kong Institute of Steel Construction, June 2023. http://dx.doi.org/10.18057/ijasc.2023.19.2.6.
Повний текст джерела