Artículos de revistas sobre el tema "Matroid Constraints"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Matroid Constraints".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Dror, Amitay, Michal Feldman y Erel Segal-Halevi. "On Fair Division under Heterogeneous Matroid Constraints". Proceedings of the AAAI Conference on Artificial Intelligence 35, n.º 6 (18 de mayo de 2021): 5312–20. http://dx.doi.org/10.1609/aaai.v35i6.16670.
Texto completoKamiyama, Naoyuki. "MATROID INTERSECTION WITH PRIORITY CONSTRAINTS". Journal of the Operations Research Society of Japan 56, n.º 1 (2013): 15–25. http://dx.doi.org/10.15807/jorsj.56.15.
Texto completoFriedrich, Tobias y Frank Neumann. "Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms". Evolutionary Computation 23, n.º 4 (diciembre de 2015): 543–58. http://dx.doi.org/10.1162/evco_a_00159.
Texto completoDo, Anh Viet y Frank Neumann. "Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints". Proceedings of the AAAI Conference on Artificial Intelligence 35, n.º 14 (18 de mayo de 2021): 12284–92. http://dx.doi.org/10.1609/aaai.v35i14.17458.
Texto completoBiswas, Arpita y Siddharth Barman. "Matroid Constrained Fair Allocation Problem". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julio de 2019): 9921–22. http://dx.doi.org/10.1609/aaai.v33i01.33019921.
Texto completoGu, Yu-Ran, Chao Bian y Chao Qian. "Submodular Maximization under the Intersection of Matroid and Knapsack Constraints". Proceedings of the AAAI Conference on Artificial Intelligence 37, n.º 4 (26 de junio de 2023): 3959–67. http://dx.doi.org/10.1609/aaai.v37i4.25510.
Texto completoSuksompong, Warut. "Constraints in fair division". ACM SIGecom Exchanges 19, n.º 2 (noviembre de 2021): 46–61. http://dx.doi.org/10.1145/3505156.3505162.
Texto completoKirály, Csaba, Zoltán Szigeti y Shin-ichi Tanigawa. "Packing of arborescences with matroid constraints via matroid intersection". Mathematical Programming 181, n.º 1 (2 de abril de 2019): 85–117. http://dx.doi.org/10.1007/s10107-019-01377-0.
Texto completoSrinivas, Mandayam A. "Matroid optimization with generalized constraints". Discrete Applied Mathematics 63, n.º 2 (noviembre de 1995): 161–74. http://dx.doi.org/10.1016/0166-218x(94)00031-8.
Texto completoRamalingam, Srikumar, Arvind Raghunathan y Daniel Nikovski. "Submodular Function Maximization for Group Elevator Scheduling". Proceedings of the International Conference on Automated Planning and Scheduling 27 (5 de junio de 2017): 233–41. http://dx.doi.org/10.1609/icaps.v27i1.13799.
Texto completoChaturvedi, Anamay, Huy Lê Nguyễn y Lydia Zakynthinou. "Differentially Private Decomposable Submodular Maximization". Proceedings of the AAAI Conference on Artificial Intelligence 35, n.º 8 (18 de mayo de 2021): 6984–92. http://dx.doi.org/10.1609/aaai.v35i8.16860.
Texto completoBengs, Daniel y Ulf Kröhne. "Adaptive Item Selection Under Matroid Constraints". Journal of Computerized Adaptive Testing 6, n.º 2 (7 de agosto de 2018): 15–36. http://dx.doi.org/10.7333/1808-0602015.
Texto completoKakimura, Naonori y Mizuyo Takamatsu. "Matching Problems with Delta-Matroid Constraints". SIAM Journal on Discrete Mathematics 28, n.º 2 (enero de 2014): 942–61. http://dx.doi.org/10.1137/110860070.
Texto completoLiu, Qian, Kemin Yu, Min Li y Yang Zhou. "$k$-Submodular Maximization with a Knapsack Constraint and $p$ Matroid Constraints". Tsinghua Science and Technology 28, n.º 5 (octubre de 2023): 896–905. http://dx.doi.org/10.26599/tst.2022.9010039.
Texto completoFriedrich, Tobias, Andreas Göbel, Frank Neumann, Francesco Quinzan y Ralf Rothenberger. "Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julio de 2019): 2272–79. http://dx.doi.org/10.1609/aaai.v33i01.33012272.
Texto completoKamiyama, Naoyuki. "Popular Matchings with Ties and Matroid Constraints". SIAM Journal on Discrete Mathematics 31, n.º 3 (enero de 2017): 1801–19. http://dx.doi.org/10.1137/15m104918x.
Texto completoKrishnaswamy, Ravishankar, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal y Barna Saha. "Facility Location with Matroid or Knapsack Constraints". Mathematics of Operations Research 40, n.º 2 (mayo de 2015): 446–59. http://dx.doi.org/10.1287/moor.2014.0678.
Texto completoGong, Suning, Qingqin Nong, Wenjing Liu y Qizhi Fang. "Parametric monotone function maximization with matroid constraints". Journal of Global Optimization 75, n.º 3 (3 de julio de 2019): 833–49. http://dx.doi.org/10.1007/s10898-019-00800-2.
Texto completoBérczi, Kristóf, Tamás Király y Yusuke Kobayashi. "Covering Intersecting Bi-set Families under Matroid Constraints". SIAM Journal on Discrete Mathematics 30, n.º 3 (enero de 2016): 1758–74. http://dx.doi.org/10.1137/15m1049099.
Texto completoZhang, Zhenliang, Yuan Wang, Edwin K. P. Chong y Ali Pezeshki. "Subspace Selection for Projection Maximization With Matroid Constraints". IEEE Transactions on Signal Processing 65, n.º 5 (1 de marzo de 2017): 1339–51. http://dx.doi.org/10.1109/tsp.2016.2634544.
Texto completoKamiyama, Naoyuki. "Pareto Stable Matchings under One-Sided Matroid Constraints". SIAM Journal on Discrete Mathematics 33, n.º 3 (enero de 2019): 1431–51. http://dx.doi.org/10.1137/17m1149717.
Texto completoKamiyama, Naoyuki. "A CHARACTERIZATION OF WEIGHTED POPULAR MATCHINGS UNDER MATROID CONSTRAINTS". Journal of the Operations Research Society of Japan 61, n.º 1 (2018): 2–17. http://dx.doi.org/10.15807/jorsj.61.2.
Texto completoLee, Jon, Vahab S. Mirrokni, Viswanath Nagarajan y Maxim Sviridenko. "Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints". SIAM Journal on Discrete Mathematics 23, n.º 4 (enero de 2010): 2053–78. http://dx.doi.org/10.1137/090750020.
Texto completoKamiyama, Naoyuki. "The popular matching and condensation problems under matroid constraints". Journal of Combinatorial Optimization 32, n.º 4 (19 de octubre de 2015): 1305–26. http://dx.doi.org/10.1007/s10878-015-9965-8.
Texto completoHan, Kai, Yuntian He, Alex X. Liu, Shaojie Tang y He Huang. "Differentially Private and Budget-Limited Bandit Learning over Matroids". INFORMS Journal on Computing 32, n.º 3 (julio de 2020): 790–804. http://dx.doi.org/10.1287/ijoc.2019.0903.
Texto completoKamiyama, Naoyuki. "Envy-free matchings with one-sided preferences and matroid constraints". Operations Research Letters 49, n.º 5 (septiembre de 2021): 790–94. http://dx.doi.org/10.1016/j.orl.2021.08.010.
Texto completoKamiyama, Naoyuki. "Popular matchings with two-sided preference lists and matroid constraints". Theoretical Computer Science 809 (febrero de 2020): 265–76. http://dx.doi.org/10.1016/j.tcs.2019.12.017.
Texto completoXue, Jue. "The optimal base of a matroid/with tree-type constraints". Acta Mathematicae Applicatae Sinica 4, n.º 2 (mayo de 1988): 97–108. http://dx.doi.org/10.1007/bf02006057.
Texto completoWu, Lin, Yang Wang, John Shepherd y Xiang Zhao. "Max-sum diversification on image ranking with non-uniform matroid constraints". Neurocomputing 118 (octubre de 2013): 10–20. http://dx.doi.org/10.1016/j.neucom.2013.02.008.
Texto completoCeccarello, Matteo, Andrea Pietracaprina y Geppino Pucci. "A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints". ACM Transactions on Knowledge Discovery from Data 14, n.º 5 (21 de agosto de 2020): 1–27. http://dx.doi.org/10.1145/3402448.
Texto completoZheng, Jiping, Yuan Ma, Wei Ma, Yanhao Wang y Xiaoyang Wang. "Happiness maximizing sets under group fairness constraints". Proceedings of the VLDB Endowment 16, n.º 2 (octubre de 2022): 291–303. http://dx.doi.org/10.14778/3565816.3565830.
Texto completoAgrawal, Akanksha, Tanmay Inamdar, Saket Saurabh y Jie Xue. "Clustering What Matters: Optimal Approximation for Clustering with Outliers". Proceedings of the AAAI Conference on Artificial Intelligence 37, n.º 6 (26 de junio de 2023): 6666–74. http://dx.doi.org/10.1609/aaai.v37i6.25818.
Texto completoRafiey, Akbar y Yuichi Yoshida. "Sparsification of Decomposable Submodular Functions". Proceedings of the AAAI Conference on Artificial Intelligence 36, n.º 9 (28 de junio de 2022): 10336–44. http://dx.doi.org/10.1609/aaai.v36i9.21275.
Texto completoEsfandiari, Hossein, MohammadTaghi HajiAghayi, Brendan Lucier y Michael Mitzenmacher. "Online Pandora’s Boxes and Bandits". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julio de 2019): 1885–92. http://dx.doi.org/10.1609/aaai.v33i01.33011885.
Texto completoLi, Bo, Xiaowei Wu, Chenyang Xu y Ruilong Zhang. "Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule". Proceedings of the AAAI Conference on Artificial Intelligence 37, n.º 5 (26 de junio de 2023): 5730–38. http://dx.doi.org/10.1609/aaai.v37i5.25711.
Texto completoKatoh, Naoki y Shin-ichi Tanigawa. "Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries". SIAM Journal on Discrete Mathematics 27, n.º 1 (enero de 2013): 155–85. http://dx.doi.org/10.1137/110846944.
Texto completoTakemura, Kei, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura y 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, n.º 11 (18 de mayo de 2021): 9791–98. http://dx.doi.org/10.1609/aaai.v35i11.17177.
Texto completoReali, Gianluca y Mauro Femminella. "Two-Layer Network Caching for Different Service Requirements". Future Internet 13, n.º 4 (27 de marzo de 2021): 85. http://dx.doi.org/10.3390/fi13040085.
Texto completoGölz, Paul y Ariel D. Procaccia. "Migration as Submodular Optimization". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julio de 2019): 549–56. http://dx.doi.org/10.1609/aaai.v33i01.3301549.
Texto completoHuang, Chien-Chung, Naonori Kakimura, Simon Mauras y Yuichi Yoshida. "Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model". SIAM Journal on Discrete Mathematics 36, n.º 1 (8 de febrero de 2022): 355–82. http://dx.doi.org/10.1137/20m1357317.
Texto completoSiddiqui, Zaheer A., Rati Shukla, Amrita Jyoti, Ayushi Prakash y Mayur Rahul. "On the Connection of Matroids and Greedy Algorithms". International Journal of Electrical and Electronics Research 10, n.º 2 (30 de junio de 2022): 126–30. http://dx.doi.org/10.37391/ijeer.100213.
Texto completoGatmiry, Khashayar y Manuel Gomez-Rodriguez. "The Network Visibility Problem". ACM Transactions on Information Systems 40, n.º 2 (30 de abril de 2022): 1–42. http://dx.doi.org/10.1145/3460475.
Texto completoWu, Jingyan, Jiawei Zhang y Yuefeng Ji. "DCEC: D2D-Enabled Cost-Aware Cooperative Caching in MEC Networks". Electronics 12, n.º 9 (24 de abril de 2023): 1974. http://dx.doi.org/10.3390/electronics12091974.
Texto completoBlajer, W., D. Bestle y W. Schiehlen. "An Orthogonal Complement Matrix Formulation for Constrained Multibody Systems". Journal of Mechanical Design 116, n.º 2 (1 de junio de 1994): 423–28. http://dx.doi.org/10.1115/1.2919396.
Texto completoAgrawal, R., G. L. Kinzel, R. Srinivasan y K. Ishii. "Engineering Constraint Management Based on an Occurrence Matrix Approach". Journal of Mechanical Design 115, n.º 1 (1 de marzo de 1993): 103–9. http://dx.doi.org/10.1115/1.2919305.
Texto completoChocat, Rudy, Loïc Brevault, Mathieu Balesdent y 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.
Texto completoSHIOURA, AKIYOSHI. "ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS". Discrete Mathematics, Algorithms and Applications 01, n.º 01 (marzo de 2009): 1–23. http://dx.doi.org/10.1142/s1793830909000063.
Texto completoSITHARAM, MEERA, YONG ZHOU y JÖRG PETERS. "RECONCILING CONFLICTING COMBINATORIAL PREPROCESSORS FOR GEOMETRIC CONSTRAINT SYSTEMS". International Journal of Computational Geometry & Applications 20, n.º 06 (diciembre de 2010): 631–51. http://dx.doi.org/10.1142/s0218195910003463.
Texto completoChen, Ying, Bei Kang, Min-Li Li, Li-Fang Wang y Chun-Hong Zhang. "Correlators in the β-deformed Gaussian Hermitian and complex matrix models". International Journal of Modern Physics A 34, n.º 33 (30 de noviembre de 2019): 1950221. http://dx.doi.org/10.1142/s0217751x1950221x.
Texto completoAziz, Haris, Péter Biró y Makoto Yokoo. "Matching Market Design with Constraints". Proceedings of the AAAI Conference on Artificial Intelligence 36, n.º 11 (28 de junio de 2022): 12308–16. http://dx.doi.org/10.1609/aaai.v36i11.21495.
Texto completo