Relevant bibliographies by topics / Matroid Constraints

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Matroid Constraints'

Author: Grafiati
Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Matroid Constraints.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Matroid Constraints"

1

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 (2021): 5312–20. http://dx.doi.org/10.1609/aaai.v35i6.16670.

Full text
Abstract:
We study fair allocation of indivisible goods among additive agents with feasibility constraints. In these settings, every agent is restricted to get a bundle among a specified set of feasible bundles. Such scenarios have been of great interest to the AI community due to their applicability to real-world problems. Following some impossibility results, we restrict attention to matroid feasibility constraints that capture natural scenarios, such as the allocation of shifts to medical doctors, and the allocation of conference papers to referees. We focus on the common fairness notion of envy-free
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Friedrich, Tobias, and Frank Neumann. "Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms." Evolutionary Computation 23, no. 4 (2015): 543–58. http://dx.doi.org/10.1162/evco_a_00159.

Full text
Abstract:
Many combinatorial optimization problems have underlying goal functions that are submodular. The classical goal is to find a good solution for a given submodular function f under a given set of constraints. In this paper, we investigate the runtime of a simple single objective evolutionary algorithm called ([Formula: see text]) EA and a multiobjective evolutionary algorithm called GSEMO until they have obtained a good approximation for submodular functions. For the case of monotone submodular functions and uniform cardinality constraints, we show that the GSEMO achieves a [Formula: see text]-a
APA, Harvard, Vancouver, ISO, and other styles
4

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 (2021): 12284–92. http://dx.doi.org/10.1609/aaai.v35i14.17458.

Full text
Abstract:
In this study, we consider the subset selection problems with submodular or monotone discrete objective functions under partition matroid constraints where the thresholds are dynamic. We focus on POMC, a simple Pareto optimization approach that has been shown to be effective on such problems. Our analysis departs from singular constraint problems and extends to problems of multiple constraints. We show that previous results of POMC's performance also hold for multiple constraints. Our experimental investigations on random undirected maxcut problems demonstrate POMC's competitiveness against th
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
We consider the problem of allocating a set of indivisible goods among a group of homogeneous agents under matroid constraints and additive valuations, in a fair manner. We propose a novel algorithm that computes a fair allocation for instances with additive and identical valuations, even under matroid constraints. Our result provides a computational anchor to the existential result of the fairness notion, called EF1 (envy-free up to one good) by Biswas and Barman in this setting. We further provide examples to show that the fairness notions stronger than EF1 does not always exist in this sett
APA, Harvard, Vancouver, ISO, and other styles
6

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 (2023): 3959–67. http://dx.doi.org/10.1609/aaai.v37i4.25510.

Full text
Abstract:
Submodular maximization arises in many applications, and has attracted a lot of research attentions from various areas such as artificial intelligence, finance and operations research. Previous studies mainly consider only one kind of constraint, while many real-world problems often involve several constraints. In this paper, we consider the problem of submodular maximization under the intersection of two commonly used constraints, i.e., k-matroid constraint and m-knapsack constraint, and propose a new algorithm SPROUT by incorporating partial enumeration into the simultaneous greedy framework
APA, Harvard, Vancouver, ISO, and other styles
7

Suksompong, Warut. "Constraints in fair division." ACM SIGecom Exchanges 19, no. 2 (2021): 46–61. http://dx.doi.org/10.1145/3505156.3505162.

Full text
Abstract:
The fair allocation of resources to interested agents is a fundamental problem in society. While the majority of the fair division literature assumes that all allocations are feasible, in practice there are often constraints on the allocation that can be chosen. In this survey, we discuss fairness guarantees for both divisible (cake cutting) and indivisible resources under several common types of constraints, including connectivity, cardinality, matroid, geometric, separation, budget, and conflict constraints. We also outline a number of open questions and directions.
APA, Harvard, Vancouver, ISO, and other styles
8

Király, Csaba, Zoltán Szigeti, and Shin-ichi Tanigawa. "Packing of arborescences with matroid constraints via matroid intersection." Mathematical Programming 181, no. 1 (2019): 85–117. http://dx.doi.org/10.1007/s10107-019-01377-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Srinivas, Mandayam A. "Matroid optimization with generalized constraints." Discrete Applied Mathematics 63, no. 2 (1995): 161–74. http://dx.doi.org/10.1016/0166-218x(94)00031-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
We propose a novel approach for group elevator scheduling by formulating it as the maximization of submodular function under a matroid constraint. In particular, we propose to model the total waiting time of passengers using a quadratic Boolean function. The unary and pairwise terms in the function denote the waiting time for single and pairwise allocation of passengers to elevators, respectively. We show that this objective function is submodular. The matroid constraints ensure that every passenger is allocated to exactly one elevator. We use a greedy algorithm to maximize the submodular obje
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Matroid Constraints"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Flieger, Wojciech. "Constraints on neutrino mixing from matrix theory." Doctoral thesis, Katowice : Uniwersytet Śląski, 2021. http://hdl.handle.net/20.500.12128/21721.

Full text
Abstract:
Jeden z kluczowych problemów współczesnej fizyki cząstek elementarnych dotyczy liczby zapachów neutrin występujących w naturze. Do tej pory udało się ustalić, ze istnieją trzy rodzaje neutrin aktywnych. Istotnym problemem jest ustalenie, czy istnieją inne dodatkowe stany neutrinowe. Neutrina takie nazywamy sterylnymi ze względu na fakt, ze ich oddziaływanie słabe ze znaną materią jest jak do tej pory poniżej eksperymentalnego progu detekcji. Niemniej jednak neutrina sterylne mogą się mieszać z neutrinami aktywnymi pozostawiając tym samym ślady swojego istnienia na poziomie Modelu Standa
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
Dans les problèmes inverses en imagerie, on suppose généralement connu l’opérateur ou matrice décrivant le système de formation de l’image. De façon équivalente pour un système linéaire, on suppose connue sa réponse impulsionnelle. Toutefois, ceci n’est pas une hypothèse réaliste pour de nombreuses applications pratiques pour lesquelles cet opérateur n’est en fait pas connu (ou n’est connu qu’approximativement). On a alors affaire à un problème d’inversion dite “aveugle”. Dans le cas de systèmes invariants par translation, on parle de “déconvolution aveugle” car à la fois l’image ou objet de d
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
This thesis presents new theoretical results and algorithms for two matrix problems with positive semidefinite constraints: it adds to the well-established nearest correlation matrix problem, and introduces a class of semidefinite Lagrangian subspaces. First, we propose shrinking, a method for restoring positive semidefiniteness of an indefinite matrix $M_0$ that computes the optimal parameter $\a_*$ in a convex combination of $M_0$ and a chosen positive semidefinite target matrix. We describe three algorithms for computing $\a_*$, and then focus on the case of keeping fixed a positive semidef
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xu, Da. "Classical groups, integrals and Virasoro constraints." Diss., University of Iowa, 2010. https://ir.uiowa.edu/etd/629.

Full text
Abstract:
First, we consider the group integrals where integrands are the monomials of matrix elements of irreducible representations of classical groups. These group integrals are invariants under the group action. Based on analysis on Young tableaux, we investigate some related duality theorems and compute the asymptotics of the group integrals for fixed signatures, as the rank of the classical groups go to infinity. We also obtain the Viraosoro constraints for some partition functions, which are power series of the group integrals. Second, we show that the proof of Witten's conjecture can be simplifi
APA, Harvard, Vancouver, ISO, and other styles
8

Bai, Shuanghua. "Numerical methods for constrained Euclidean distance matrix optimization." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/401542/.

Full text
Abstract:
This thesis is an accumulation of work regarding a class of constrained Euclidean Distance Matrix (EDM) based optimization models and corresponding numerical approaches. EDM-based optimization is powerful for processing distance information which appears in diverse applications arising from a wide range of fields, from which the motivation for this work comes. Those problems usually involve minimizing the error of distance measurements as well as satisfying some Euclidean distance constraints, which may present enormous challenge to the existing algorithms. In this thesis, we focus on problems
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
Das Standardmodell einer zusätzlichen sequentiellen Fermiongeneration (SM4) war 2012 auf Basis eines Fits an elektroschwache Präzisionsobservable und die Higgs-Signalstärken mit einer Signifikanz von 5.3 sigma ausgeschlossen worden. Komplementär dazu wurden in der vorliegenden Arbeit Fits des SM4 an eine Kombination eines typischen Satzes von Flavour-Observablen mit den Ergebnissen des zuvor durchgeführten Elektroschwachen Präzisionsfits durchgeführt. Im SM3-Kontext extrahierte Größen wurden gemäß ihrer Bedeutung im SM4 reinterpretiert und die angepassten theoretischen Ausdrücke ange
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Matroid Constraints"

1

C, Chamis C., and United States. National Aeronautics and Space Administration., eds. Composite laminate tailoring with probabilistic constraints and loads. NASA, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Huacheng. Estimation of Q-matrix for DINA Model Using the Constrained Generalized DINA Framework. [publisher not identified], 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
Exponential random graph models (ERGMs) provide conceptually elegant recipes for generating soft-constrained random graphs. This chapter begins by explaining the theory and describing how to properly specify an ERGM, including demonstrating Lagrange’s method to derive the values of the model parameters that correspond to the desired constraints. Three ERGMs, all with constraints depending linearly on the adjacency matrix, are solved exactly: the targeted total number of links, targeted individual node degrees and targeted number of two-way links in a directed graph. However, when the controlle
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
This article discusses the interaction between random matrix theory (RMT) and integrable theory, leading to ordinary and partial differential equations (PDEs) for the eigenvalue distribution of random matrix models of size n and the transition probabilities of non-intersecting Brownian motion models, for finite n and for n → ∞. It first provides an overview of the connection between the theory of orthogonal polynomials and the KP-hierarchy in integrable systems before examining matrix models and the Virasoro constraints. It then considers multiple orthogonal polynomials, taking into account no
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
This article describes the application of random matrix theory (RMT) to the estimation of the bipartite entanglement of a quantum system, with particular emphasis on the extreme eigenvalues of Wishart matrices. It first provides an overview of some spectral properties of unconstrained Wishart matrices before introducing the problem of the random pure state of an entangled quantum bipartite system consisting of two subsystems whose Hilbert spaces have dimensions M and N respectively with N ≤ M. The focus is on the smallest eigenvalue which serves as an important measure of entanglement between
APA, Harvard, Vancouver, ISO, and other styles
6

Hu, Xuhui. The syntax and semantics of English resultatives. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198808466.003.0003.

Full text
Abstract:
This chapter argues that the English resultative construction denotes a single event involving two predicates. Therefore, only a single EP is involved in the syntactic derivation. The special thematic relationship is due to constraints imposed by the Integration Conditions proposed in Chapter 2. Dispensing with the CAUSE head of the event decomposition approach, this chapter explains the possible lack of causative meaning in English resultatives. A secondary predicate in a resultative can get a dynamic BECOME meaning (such as flat in John hammered the metal flat) because the secondary predicat
APA, Harvard, Vancouver, ISO, and other styles
7

Hu, Xuhui. Encoding applied arguments. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198808466.003.0006.

Full text
Abstract:
This chapter applies the theoretical framework of events to the study of non-core arguments. The applied argument in the symmetric applicative construction is introduced by a PP. This PP serves as the modifier of the event predicate, and its head, a null P, is incorporated into V. In an asymmetric applicative, including the ditransitive construction in English, two predicates are involved: in addition to the matrix verb, the other predicate is a PHAVEP. The derivation of this construction is therefore by nature identical to that of English resultatives. An implication of this chapter concerns
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
Abstract:
This chapter deals with the acceptability and interpretation of referential null subjects (NSs) and compares consistent pro-drop in Italian with equivalent sentences in Finnish (a partial NS language), in different syntactic constructions (matrix, completive, factive, and adverbial clauses). This leads to the formulation of an original proposal that opens new perspectives for future research. Specifically, based on the interpretive judgements of 273 native speakers of Finnish, it is shown that a Topic chain analysis (Frascarelli 2007) can (and should) be assumed in partial NS languages as well
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
The Hospital and Clinic Improvement Handbook is about doing more using existing resources. For example, achieving more throughput in the operating rooms, reducing waiting times at the emergency department, and improving clinical quality. This is done using the well-established Lean techniques together with the breakthrough philosophies and techniques of the theory of constraints (TOC). These methods and their underlying tools are put together with techniques and methodologies implemented by the authors in dozens of healthcare organizations. The tools include the complete kit concept, the Paret
APA, Harvard, Vancouver, ISO, and other styles
10

Johnston, Ron. Geography and International Studies: The Foundations. Oxford University Press, 2017. http://dx.doi.org/10.1093/acrefore/9780190846626.013.199.

Full text
Abstract:
The discipline of geography is built around four key concepts—environment, place, space, and scale—that form a matrix for exploring and appreciating many aspects of contemporary society. The environment is the ultimate source of human sustenance; people have created places to realize that potential; and a spatial structure—nodes, routes, surfaces and bounded territories—has been erected within which human interactions are organised.The relationships between human societies and their environments—now very much changed from their pre-human “natural” state—involve competition for and conflicts ov
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Matroid Constraints"

1

Benabbou, Nawal, Cassandre Leroy, Thibaut Lust, and Patrice Perny. "Interactive Optimization of Submodular Functions Under Matroid Constraints." In Algorithmic Decision Theory. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87756-9_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Henzinger, Monika, and Angelina Vidali. "Multi-parameter Mechanism Design under Budget and Matroid Constraints." In Algorithms – ESA 2011. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23719-5_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kamiyama, Naoyuki. "The Popular Matching and Condensation Problems Under Matroid Constraints." In Combinatorial Optimization and Applications. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12691-3_53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, Zhicheng, Jing Jin, Donglei Du, and Xiaoyan Zhang. "Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints." In Lecture Notes in Computer Science. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-20350-3_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kamiyama, Naoyuki. "Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints." In Algorithmic Game Theory. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48433-3_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59267-7_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-17402-6_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Friedrich, Tobias, and Frank Neumann. "Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms." In Parallel Problem Solving from Nature – PPSN XIII. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10762-2_91.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31594-7_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58115-2_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Matroid Constraints"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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. ACM, 2013. http://dx.doi.org/10.1145/2487575.2487636.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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. ACM, 2018. http://dx.doi.org/10.1145/3159652.3159719.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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. ACM Press, 2009. http://dx.doi.org/10.1145/1536414.1536459.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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. ACM, 2019. http://dx.doi.org/10.1145/3313276.3316389.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/311.

Full text
Abstract:
We investigate the problem of random assignment of indivisible goods, in which each agent has an ordinal preference and a constraint. Our goal is to characterize the conditions under which there always exists a random assignment that simultaneously satisfies efficiency and envy-freeness. The probabilistic serial mechanism ensures the existence of such an assignment for the unconstrained setting. In this paper, we consider a more general setting in which each agent can consume a set of items only if the set satisfies her feasibility constraint. Such constraints must be taken into account in stu
APA, Harvard, Vancouver, ISO, and other styles
10

Biswas, Arpita, and Siddharth Barman. "Fair Division Under Cardinality Constraints." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/13.

Full text
Abstract:
We consider the problem of fairly allocating indivisible goods, among agents, under cardinality constraints and additive valuations. In this setting, we are given a partition of the entire set of goods---i.e., the goods are categorized---and a limit is specified on the number of goods that can be allocated from each category to any agent. The objective here is to find a fair allocation in which the subset of goods assigned to any agent satisfies the given cardinality constraints. This problem naturally captures a number of resource-allocation applications, and is a generalization of the well-s
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Matroid Constraints"

1

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), 1997. http://dx.doi.org/10.2172/554827.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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), 2011. http://dx.doi.org/10.2172/1038211.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Carvalho, Joana, and Gerardo Reyes-Tagle. Risk Matrix and PPP Contract Standardization, Best Practice, and Gap Analysis in Brazil. Inter-American Development Bank, 2022. http://dx.doi.org/10.18235/0004213.

Full text
Abstract:
Public-private partnerships (PPPs) have been used to address the need for the implementation of huge investment programs and to bridge the infrastructure gap that exists in Latin American and Caribbean (LAC) countries. As is explained throughout this paper, under certain circumstances, PPPs represent an important tool to help governments implement their investment programs, thereby benefiting not only from private investment (which often includes foreign investment) but also from the various advantages that are typically associated with the PPP model. However, the need to secure financing for
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
To better constrain the origin of the chromitites associated with the Esker Intrusive Complex (EIC) of the Ring of Fire Intrusive Suite (RoFIS), a total of 50 chromite-bearing samples from the Black Thor, Big Daddy, Blackbird, and Black Label chromite deposits have been analysed for major and trace elements. The samples represent three textural groups, as defined by the relative abundance of cumulate silicate phases and chromite. To provide deposit-specific partition coefficients for modeling, we also report on the results of laboratory experiments to measure olivine- and chromite-melt partiti
APA, Harvard, Vancouver, ISO, and other styles
5

HIGH PRECISION IDENTIFICATION METHOD OF MASS AND STIFFNESS MATRIX FOR SHEAR-TYPE FRAME TEST MODEL. The Hong Kong Institute of Steel Construction, 2023. http://dx.doi.org/10.18057/ijasc.2023.19.2.6.

Full text
Abstract:
In the direct method of identifying the physical parameters of the shear-type frame structures through the frequencies and modes from the experimental modal analysis (EMA), the accuracy of the lumped mass depends on the initial mass, while the identified mass matrix and stiffness matrix are prone to generate some matrix elements without any physical meaning. In this paper, based on the natural frequencies and modes obtained from the EMA, an iterative constrained optimization solution for correcting mass matrix and a least squares solution for the lateral stiffness are proposed. The method take
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography