Статті в журналах з теми "Matroid Constraints"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Matroid Constraints".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерелаChaturvedi, Anamay, Huy Lê Nguyễn, and Lydia Zakynthinou. "Differentially Private Decomposable Submodular Maximization." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 8 (May 18, 2021): 6984–92. http://dx.doi.org/10.1609/aaai.v35i8.16860.
Повний текст джерелаBengs, Daniel, and Ulf Kröhne. "Adaptive Item Selection Under Matroid Constraints." Journal of Computerized Adaptive Testing 6, no. 2 (August 7, 2018): 15–36. http://dx.doi.org/10.7333/1808-0602015.
Повний текст джерелаKakimura, Naonori, and Mizuyo Takamatsu. "Matching Problems with Delta-Matroid Constraints." SIAM Journal on Discrete Mathematics 28, no. 2 (January 2014): 942–61. http://dx.doi.org/10.1137/110860070.
Повний текст джерелаLiu, Qian, Kemin Yu, Min Li, and Yang Zhou. "$k$-Submodular Maximization with a Knapsack Constraint and $p$ Matroid Constraints." Tsinghua Science and Technology 28, no. 5 (October 2023): 896–905. http://dx.doi.org/10.26599/tst.2022.9010039.
Повний текст джерелаFriedrich, Tobias, Andreas Göbel, Frank Neumann, Francesco Quinzan, and Ralf Rothenberger. "Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2272–79. http://dx.doi.org/10.1609/aaai.v33i01.33012272.
Повний текст джерелаKamiyama, Naoyuki. "Popular Matchings with Ties and Matroid Constraints." SIAM Journal on Discrete Mathematics 31, no. 3 (January 2017): 1801–19. http://dx.doi.org/10.1137/15m104918x.
Повний текст джерелаKrishnaswamy, Ravishankar, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, and Barna Saha. "Facility Location with Matroid or Knapsack Constraints." Mathematics of Operations Research 40, no. 2 (May 2015): 446–59. http://dx.doi.org/10.1287/moor.2014.0678.
Повний текст джерелаGong, Suning, Qingqin Nong, Wenjing Liu, and Qizhi Fang. "Parametric monotone function maximization with matroid constraints." Journal of Global Optimization 75, no. 3 (July 3, 2019): 833–49. http://dx.doi.org/10.1007/s10898-019-00800-2.
Повний текст джерелаBérczi, Kristóf, Tamás Király, and Yusuke Kobayashi. "Covering Intersecting Bi-set Families under Matroid Constraints." SIAM Journal on Discrete Mathematics 30, no. 3 (January 2016): 1758–74. http://dx.doi.org/10.1137/15m1049099.
Повний текст джерелаZhang, Zhenliang, Yuan Wang, Edwin K. P. Chong, and Ali Pezeshki. "Subspace Selection for Projection Maximization With Matroid Constraints." IEEE Transactions on Signal Processing 65, no. 5 (March 1, 2017): 1339–51. http://dx.doi.org/10.1109/tsp.2016.2634544.
Повний текст джерелаKamiyama, Naoyuki. "Pareto Stable Matchings under One-Sided Matroid Constraints." SIAM Journal on Discrete Mathematics 33, no. 3 (January 2019): 1431–51. http://dx.doi.org/10.1137/17m1149717.
Повний текст джерелаKamiyama, Naoyuki. "A CHARACTERIZATION OF WEIGHTED POPULAR MATCHINGS UNDER MATROID CONSTRAINTS." Journal of the Operations Research Society of Japan 61, no. 1 (2018): 2–17. http://dx.doi.org/10.15807/jorsj.61.2.
Повний текст джерелаLee, Jon, Vahab S. Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko. "Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints." SIAM Journal on Discrete Mathematics 23, no. 4 (January 2010): 2053–78. http://dx.doi.org/10.1137/090750020.
Повний текст джерелаKamiyama, Naoyuki. "The popular matching and condensation problems under matroid constraints." Journal of Combinatorial Optimization 32, no. 4 (October 19, 2015): 1305–26. http://dx.doi.org/10.1007/s10878-015-9965-8.
Повний текст джерелаHan, Kai, Yuntian He, Alex X. Liu, Shaojie Tang, and He Huang. "Differentially Private and Budget-Limited Bandit Learning over Matroids." INFORMS Journal on Computing 32, no. 3 (July 2020): 790–804. http://dx.doi.org/10.1287/ijoc.2019.0903.
Повний текст джерелаKamiyama, Naoyuki. "Envy-free matchings with one-sided preferences and matroid constraints." Operations Research Letters 49, no. 5 (September 2021): 790–94. http://dx.doi.org/10.1016/j.orl.2021.08.010.
Повний текст джерелаKamiyama, Naoyuki. "Popular matchings with two-sided preference lists and matroid constraints." Theoretical Computer Science 809 (February 2020): 265–76. http://dx.doi.org/10.1016/j.tcs.2019.12.017.
Повний текст джерелаXue, Jue. "The optimal base of a matroid/with tree-type constraints." Acta Mathematicae Applicatae Sinica 4, no. 2 (May 1988): 97–108. http://dx.doi.org/10.1007/bf02006057.
Повний текст джерелаWu, Lin, Yang Wang, John Shepherd, and Xiang Zhao. "Max-sum diversification on image ranking with non-uniform matroid constraints." Neurocomputing 118 (October 2013): 10–20. http://dx.doi.org/10.1016/j.neucom.2013.02.008.
Повний текст джерелаCeccarello, Matteo, Andrea Pietracaprina, and Geppino Pucci. "A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints." ACM Transactions on Knowledge Discovery from Data 14, no. 5 (August 21, 2020): 1–27. http://dx.doi.org/10.1145/3402448.
Повний текст джерелаZheng, Jiping, Yuan Ma, Wei Ma, Yanhao Wang, and Xiaoyang Wang. "Happiness maximizing sets under group fairness constraints." Proceedings of the VLDB Endowment 16, no. 2 (October 2022): 291–303. http://dx.doi.org/10.14778/3565816.3565830.
Повний текст джерелаAgrawal, Akanksha, Tanmay Inamdar, Saket Saurabh, and Jie Xue. "Clustering What Matters: Optimal Approximation for Clustering with Outliers." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 6 (June 26, 2023): 6666–74. http://dx.doi.org/10.1609/aaai.v37i6.25818.
Повний текст джерелаRafiey, Akbar, and Yuichi Yoshida. "Sparsification of Decomposable Submodular Functions." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 9 (June 28, 2022): 10336–44. http://dx.doi.org/10.1609/aaai.v36i9.21275.
Повний текст джерелаEsfandiari, Hossein, MohammadTaghi HajiAghayi, Brendan Lucier, and Michael Mitzenmacher. "Online Pandora’s Boxes and Bandits." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 1885–92. http://dx.doi.org/10.1609/aaai.v33i01.33011885.
Повний текст джерелаLi, Bo, Xiaowei Wu, Chenyang Xu, and Ruilong Zhang. "Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 5 (June 26, 2023): 5730–38. http://dx.doi.org/10.1609/aaai.v37i5.25711.
Повний текст джерелаKatoh, Naoki, and Shin-ichi Tanigawa. "Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries." SIAM Journal on Discrete Mathematics 27, no. 1 (January 2013): 155–85. http://dx.doi.org/10.1137/110846944.
Повний текст джерелаTakemura, Kei, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, and Ken-ichi Kawarabayashi. "Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 11 (May 18, 2021): 9791–98. http://dx.doi.org/10.1609/aaai.v35i11.17177.
Повний текст джерелаReali, Gianluca, and Mauro Femminella. "Two-Layer Network Caching for Different Service Requirements." Future Internet 13, no. 4 (March 27, 2021): 85. http://dx.doi.org/10.3390/fi13040085.
Повний текст джерелаGölz, Paul, and Ariel D. Procaccia. "Migration as Submodular Optimization." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 549–56. http://dx.doi.org/10.1609/aaai.v33i01.3301549.
Повний текст джерелаHuang, Chien-Chung, Naonori Kakimura, Simon Mauras, and Yuichi Yoshida. "Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model." SIAM Journal on Discrete Mathematics 36, no. 1 (February 8, 2022): 355–82. http://dx.doi.org/10.1137/20m1357317.
Повний текст джерелаSiddiqui, Zaheer A., Rati Shukla, Amrita Jyoti, Ayushi Prakash, and Mayur Rahul. "On the Connection of Matroids and Greedy Algorithms." International Journal of Electrical and Electronics Research 10, no. 2 (June 30, 2022): 126–30. http://dx.doi.org/10.37391/ijeer.100213.
Повний текст джерелаGatmiry, Khashayar, and Manuel Gomez-Rodriguez. "The Network Visibility Problem." ACM Transactions on Information Systems 40, no. 2 (April 30, 2022): 1–42. http://dx.doi.org/10.1145/3460475.
Повний текст джерелаWu, Jingyan, Jiawei Zhang, and Yuefeng Ji. "DCEC: D2D-Enabled Cost-Aware Cooperative Caching in MEC Networks." Electronics 12, no. 9 (April 24, 2023): 1974. http://dx.doi.org/10.3390/electronics12091974.
Повний текст джерелаBlajer, W., D. Bestle, and W. Schiehlen. "An Orthogonal Complement Matrix Formulation for Constrained Multibody Systems." Journal of Mechanical Design 116, no. 2 (June 1, 1994): 423–28. http://dx.doi.org/10.1115/1.2919396.
Повний текст джерелаAgrawal, R., G. L. Kinzel, R. Srinivasan, and K. Ishii. "Engineering Constraint Management Based on an Occurrence Matrix Approach." Journal of Mechanical Design 115, no. 1 (March 1, 1993): 103–9. http://dx.doi.org/10.1115/1.2919305.
Повний текст джерелаChocat, Rudy, Loïc Brevault, Mathieu Balesdent, and Sébastien Defoort. "Modified Covariance Matrix Adaptation – Evolution Strategy algorithm for constrained optimization under uncertainty, application to rocket design." International Journal for Simulation and Multidisciplinary Design Optimization 6 (2015): A1. http://dx.doi.org/10.1051/smdo/2015001.
Повний текст джерелаSHIOURA, AKIYOSHI. "ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS." Discrete Mathematics, Algorithms and Applications 01, no. 01 (March 2009): 1–23. http://dx.doi.org/10.1142/s1793830909000063.
Повний текст джерелаSITHARAM, MEERA, YONG ZHOU, and JÖRG PETERS. "RECONCILING CONFLICTING COMBINATORIAL PREPROCESSORS FOR GEOMETRIC CONSTRAINT SYSTEMS." International Journal of Computational Geometry & Applications 20, no. 06 (December 2010): 631–51. http://dx.doi.org/10.1142/s0218195910003463.
Повний текст джерелаChen, Ying, Bei Kang, Min-Li Li, Li-Fang Wang та Chun-Hong Zhang. "Correlators in the β-deformed Gaussian Hermitian and complex matrix models". International Journal of Modern Physics A 34, № 33 (30 листопада 2019): 1950221. http://dx.doi.org/10.1142/s0217751x1950221x.
Повний текст джерелаAziz, Haris, Péter Biró, and Makoto Yokoo. "Matching Market Design with Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 11 (June 28, 2022): 12308–16. http://dx.doi.org/10.1609/aaai.v36i11.21495.
Повний текст джерела