Bibliographies thématiques / Combinatorial exchange / Articles de revues

Articles de revues sur le sujet « Combinatorial exchange »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Combinatorial exchange.
Auteur : Grafiati
Publié le 11 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Combinatorial exchange ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Lubin, B., A. I. Juda, R. Cavallo, S. Lahaie, J. Shneidman et D. C. Parkes. « ICE : An Expressive Iterative Combinatorial Exchange ». Journal of Artificial Intelligence Research 33 (22 septembre 2008) : 33–77. http://dx.doi.org/10.1613/jair.2440.

Texte intégral
Résumé :
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is concise and expressive for CEs. Bidders specify lower and upper bounds in TBBL on their value for different trades and refine these bounds across rounds. These bounds allow price discovery and useful preference elicitation in early rounds, and allow termination with an efficient trade despite partial information on bidder valuations. All computation in the exchange is carefully optimized to exploit the structure of the bid-trees and to avoid enumerating trades. A proxied interpretation of a revealed-preference activity rule, coupled with simple linear prices, ensures progress across rounds. The exchange is fully implemented, and we give results demonstrating several aspects of its scalability and economic properties with simulated bidding strategies.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Faigle, Ulrich. « Exchange properties of combinatorial closure spaces ». Discrete Applied Mathematics 15, no 2-3 (novembre 1986) : 249–60. http://dx.doi.org/10.1016/0166-218x(86)90046-6.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Kamra, Nitin, T. K. Satish Kumar et Nora Ayanian. « Combinatorial Problems in Multirobot Battery Exchange Systems ». IEEE Transactions on Automation Science and Engineering 15, no 2 (avril 2018) : 852–62. http://dx.doi.org/10.1109/tase.2017.2767379.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Hoffman, Karla, et Dinesh Menon. « A Practical Combinatorial Clock Exchange for Spectrum Licenses ». Decision Analysis 7, no 1 (mars 2010) : 58–77. http://dx.doi.org/10.1287/deca.1090.0169.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Liebling, T. M. « Large Scale Combinatorial Optimization Problems : Randomized Exchange Heuristics ». IFAC Proceedings Volumes 20, no 9 (août 1987) : 73–80. http://dx.doi.org/10.1016/s1474-6670(17)55683-9.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Schwind, Michael, Oleg Gujo et Jens Vykoukal. « A combinatorial intra-enterprise exchange for logistics services ». Information Systems and e-Business Management 7, no 4 (15 novembre 2008) : 447–71. http://dx.doi.org/10.1007/s10257-008-0102-4.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

McElfresh, Duncan C., Hoda Bidkhori et John P. Dickerson. « Scalable Robust Kidney Exchange ». Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 juillet 2019) : 1077–84. http://dx.doi.org/10.1609/aaai.v33i01.33011077.

Texte intégral
Résumé :
In barter exchanges, participants directly trade their endowed goods in a constrained economic setting without money. Transactions in barter exchanges are often facilitated via a central clearinghouse that must match participants even in the face of uncertainty—over participants, existence and quality of potential trades, and so on. Leveraging robust combinatorial optimization techniques, we address uncertainty in kidney exchange, a real-world barter market where patients swap (in)compatible paired donors. We provide two scalable robust methods to handle two distinct types of uncertainty in kidney exchange—over the quality and the existence of a potential match. The latter case directly addresses a weakness in all stochastic-optimization-based methods to the kidney exchange clearing problem, which all necessarily require explicit estimates of the probability of a transaction existing—a still-unsolved problem in this nascent market. We also propose a novel, scalable kidney exchange formulation that eliminates the need for an exponential-time constraint generation process in competing formulations, maintains provable optimality, and serves as a subsolver for our robust approach. For each type of uncertainty we demonstrate the benefits of robustness on real data from a large, fielded kidney exchange in the United States. We conclude by drawing parallels between robustness and notions of fairness in the kidney exchange setting.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Pellegrini, Paola, Lorenzo Castelli et Raffaele Pesenti. « Secondary trading of airport slots as a combinatorial exchange ». Transportation Research Part E : Logistics and Transportation Review 48, no 5 (septembre 2012) : 1009–22. http://dx.doi.org/10.1016/j.tre.2012.03.004.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Ivanisevic, Albena, Kim V. McCumber et Chad A. Mirkin. « Site-Directed Exchange Studies with Combinatorial Libraries of Nanostructures ». Journal of the American Chemical Society 124, no 40 (octobre 2002) : 11997–2001. http://dx.doi.org/10.1021/ja0203871.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Bichler, Martin, Vladimir Fux et Jacob K. Goeree. « Designing combinatorial exchanges for the reallocation of resource rights ». Proceedings of the National Academy of Sciences 116, no 3 (31 décembre 2018) : 786–91. http://dx.doi.org/10.1073/pnas.1802123116.

Texte intégral
Résumé :
We describe the design and implementation of a combinatorial exchange for trading catch shares in New South Wales, Australia. The exchange ended a decades-long political debate by providing a market-based response to a major policy problem faced by fisheries worldwide: the reallocation of catch shares in cap-and-trade programs designed to prevent overfishing. The exchange was conducted over the Internet to lower participation costs and allowed for all-or-nothing orders to avoid fragmented share portfolios. A subsidy was distributed endogenously to facilitate the transfer of shares from inactive to active fishers. Finally, prices were linear and anonymous to ensure that sellers of identical packages received the same payments. These features were crucial to mitigate economic distortions from introducing catch shares and to gain broad acceptance of the program. However, they led to computationally challenging allocation and pricing problems. The exchange operated from May to July 2017 and effectively reallocated shares from inactive fishers to those who needed them most: 86% of active fishers’ bids were matched and their share deficits were reduced by 95% in high-priority share classes. Similar reallocation problems arise in fisheries with catch-share systems worldwide as well as in other cap-and-trade systems for resource rights, e.g., water and pollution rights. The implemented exchange illustrates how computational optimization and market design can provide policy tools, able to solve complex policy problems considered intractable only a few years ago.
Styles APA, Harvard, Vancouver, ISO, etc.
11

Rasmussen, Brian, Anne Sørensen, Henrik Gotfredsen et Michael Pittelkow. « Dynamic combinatorial chemistry with diselenides and disulfides in water ». Chem. Commun. 50, no 28 (2014) : 3716–18. http://dx.doi.org/10.1039/c4cc00523f.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
12

Gianga, Tiberiu-Marius, Dora-Maria Răsădean et G. Dan Pantoș. « Pyrroloindole-Based Dynamic Combinatorial Chemistry ». Symmetry 12, no 5 (3 mai 2020) : 726. http://dx.doi.org/10.3390/sym12050726.

Texte intégral
Résumé :
We report a new class of building blocks for Dynamic Combinatorial Chemistry (DCC) based on the pyrroloindole scaffold. The attachment of l-cysteine on the α, α′ positions of the core makes the molecule suitable for disulfide exchange in aqueous dynamic combinatorial libraries (DCLs). The synthesis of the core follows a modified version of the Knoevenagel–Hemetsberger approach. The new building block (l-PI) is fluorescent (Φ = 48%) and relatively stable towards thermal and photodegradation. The chirality of the cysteine is transferred to the electron-rich pyrroloindole core. Homo- and heterochiral DCLs of l-PI with electron-deficient l- and d-naphthalenediimide (NDI) lead to similar library distributions regardless of the enantiomer used. When no salt is present, the major component is a dimer, while dimers and tetramers are obtained at increased ionic strength.
Styles APA, Harvard, Vancouver, ISO, etc.
13

Escalante, Andrea M., A. Gastón Orrillo et Ricardo L. E. Furlan. « Simultaneous and Orthogonal Covalent Exchange Processes in Dynamic Combinatorial Libraries ». Journal of Combinatorial Chemistry 12, no 4 (12 juillet 2010) : 410–13. http://dx.doi.org/10.1021/cc100046r.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
14

Orrillo, A. Gastón, Andrea M. Escalante et Ricardo L. E. Furlan. « Covalent double level dynamic combinatorial libraries : selectively addressable exchange processes ». Chemical Communications, no 42 (2008) : 5298. http://dx.doi.org/10.1039/b808565j.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
15

Ingerman, Lindsey A., et Marcey L. Waters. « Photoswitchable Dynamic Combinatorial Libraries : Coupling Azobenzene Photoisomerization with Hydrazone Exchange ». Journal of Organic Chemistry 74, no 1 (2 janvier 2009) : 111–17. http://dx.doi.org/10.1021/jo801783w.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
16

Cassaigne, Julien, Sébastien Ferenczi et Luca Q. Zamboni. « Combinatorial trees arising in the study of interval exchange transformations ». European Journal of Combinatorics 32, no 8 (novembre 2011) : 1428–44. http://dx.doi.org/10.1016/j.ejc.2011.05.002.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
17

Li, Yuan, Haoxun Chen et Christian Prins. « A Lagrangian relaxation approach to combinatorial exchange in freight logistics ». IFAC-PapersOnLine 49, no 12 (2016) : 1650–55. http://dx.doi.org/10.1016/j.ifacol.2016.07.817.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
18

Orrillo, A. Gastón, Andrea M. Escalante et Ricardo L. E. Furlan. « Dithioacetal Exchange : A New Reversible Reaction for Dynamic Combinatorial Chemistry ». Chemistry - A European Journal 22, no 20 (5 avril 2016) : 6746–49. http://dx.doi.org/10.1002/chem.201600208.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
19

Wang, Lei, De Chen Zhan, Lan Shun Nie, Dian Hui Chu et Xiao Fei Xu. « Multiagent Based Dynamic Resource Control for Decentralized Multi-Project Using Combinatorial Exchange ». Advanced Materials Research 532-533 (juin 2012) : 566–70. http://dx.doi.org/10.4028/www.scientific.net/amr.532-533.566.

Texte intégral
Résumé :
Decentralized multi-project environment is very common in modern times, and the dynamic resource control problem for this project environment has attracted more attention. Traditional optimization method for multi-project based on the centralization in decision making does not suit for solving this problem any more. In this paper, we analyze the distributed decision making process for the dynamic resource control in the decentralized multi-project environment, and present a multi-agent system model for this problem. Using combinatorial exchange based on market, we design a negotiation mechanism to cope with the time disruptions in the stage of project execution. Computational results show that the combinatorial exchange mechanism could solve the problem effectively and has a powerful controllability for the different weights of the multiple projects.
Styles APA, Harvard, Vancouver, ISO, etc.
20

BOISSY, CORENTIN, et ERWAN LANNEAU. « Dynamics and geometry of the Rauzy–Veech induction for quadratic differentials ». Ergodic Theory and Dynamical Systems 29, no 3 (juin 2009) : 767–816. http://dx.doi.org/10.1017/s0143385708080565.

Texte intégral
Résumé :
AbstractInterval exchange maps are related to geodesic flows on translation surfaces; they correspond to the first return maps of the vertical flow on a transverse segment. The Rauzy–Veech induction on the space of interval exchange maps provides a powerful tool to analyze the Teichmüller geodesic flow on the moduli space of Abelian differentials. Several major results have been proved using this renormalization. Danthony and Nogueira introduced in 1988 a natural generalization of interval exchange transformations, namely linear involutions. These maps are related to general measured foliations on surfaces (whether orientable or not). In this paper we are interested by such maps related to geodesic flow on (orientable) flat surfaces with ℤ/2ℤ linear holonomy. We relate geometry and dynamics of such maps to the combinatorics of generalized permutations. We study an analogue of the Rauzy–Veech induction and give an efficient combinatorial characterization of its attractors. We establish a natural bijection between the extended Rauzy classes of generalized permutations and connected components of the strata of meromorphic quadratic differentials with at most simple poles, which allows us, in particular, to classify the connected components of all exceptional strata.
Styles APA, Harvard, Vancouver, ISO, etc.
21

Diemer, Sanna, Morten Kristensen, Brian Rasmussen, Sophie Beeren et Michael Pittelkow. « Simultaneous Disulfide and Boronic Acid Ester Exchange in Dynamic Combinatorial Libraries ». International Journal of Molecular Sciences 16, no 9 (10 septembre 2015) : 21858–72. http://dx.doi.org/10.3390/ijms160921858.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
22

Saiz, Cecilia, Peter Wipf, Eduardo Manta et Graciela Mahler. « Reversible Thiazolidine Exchange : A New Reaction Suitable for Dynamic Combinatorial Chemistry ». Organic Letters 11, no 15 (6 août 2009) : 3170–73. http://dx.doi.org/10.1021/ol901104a.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
23

Saiz, Cecilia, Peter Wipf, Eduardo Manta et Graciela Mahler. « Reversible Thiazolidine Exchange : A New Reaction Suitable for Dynamic Combinatorial Chemistry ». Organic Letters 12, no 14 (16 juillet 2010) : 3284. http://dx.doi.org/10.1021/ol101274p.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
24

Grusea, Simona, et Anthony Labarre. « Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution ». Advances in Applied Mathematics 78 (juillet 2016) : 94–113. http://dx.doi.org/10.1016/j.aam.2016.04.002.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
25

Kulkarni, Bheemashankar A., et Arasu Ganesan. « Ion-Exchange Resins for Combinatorial Synthesis : 2,4-Pyrrolidinediones by Dieckmann Condensation ». Angewandte Chemie International Edition in English 36, no 22 (1 décembre 1997) : 2454–55. http://dx.doi.org/10.1002/anie.199724541.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
26

Gaspers, Serge, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh et Stefan Szeider. « Don't Be Strict in Local Search ! » Proceedings of the AAAI Conference on Artificial Intelligence 26, no 1 (20 septembre 2021) : 486–92. http://dx.doi.org/10.1609/aaai.v26i1.8128.

Texte intégral
Résumé :
Local Search is one of the fundamental approaches to combinatorial optimization and it is used throughout AI. Several local search algorithms are based on searching the k-exchange neighborhood. This is the set of solutions that can be obtained from the current solution by exchanging at most k elements. As a rule of thumb, the larger k is, the better are the chances of finding an improved solution. However, for inputs of size n, a naive brute-force search of the k-exchange neighborhood requires n(O(k)) time, which is not practical even for very small values of k. Fellows et al. (IJCAI 2009) studied whether this brute-force search is avoidable and gave positive and negative answers for several combinatorial problems. They used the notion of local search in a strict sense. That is, an improved solution needs to be found in the k-exchange neighborhood even if a global optimum can be found efficiently. In this paper we consider a natural relaxation of local search, called permissive local search (Marx and Schlotter, IWPEC 2009) and investigate whether it enhances the domain of tractable inputs. We exemplify this approach on a fundamental combinatorial problem, Vertex Cover. More precisely, we show that for a class of inputs, finding an optimum is hard, strict local search is hard, but permissive local search is tractable. We carry out this investigation in the framework of parameterized complexity.
Styles APA, Harvard, Vancouver, ISO, etc.
27

Jones, D. Dafydd. « Recombining Low Homology, Functionally Rich Regions of Bacterial Subtilisins by Combinatorial Fragment Exchange ». PLoS ONE 6, no 9 (7 septembre 2011) : e24319. http://dx.doi.org/10.1371/journal.pone.0024319.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
28

Chen, Haoxun. « Combinatorial clock-proxy exchange for carrier collaboration in less than truck load transportation ». Transportation Research Part E : Logistics and Transportation Review 91 (juillet 2016) : 152–72. http://dx.doi.org/10.1016/j.tre.2016.04.008.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
29

Leclaire, Julien, Laurent Vial, Sijbren Otto et Jeremy K. M. Sanders. « Expanding diversity in dynamic combinatorial libraries : simultaneous exchange of disulfide and thioester linkages ». Chemical Communications, no 15 (2005) : 1959. http://dx.doi.org/10.1039/b500638d.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
30

Ferenczi, Sébastien, Charles Holton et Luca Q. Zamboni. « Structure of three-interval exchange transformations II : a combinatorial description of the tranjectories ». Journal d'Analyse Mathématique 89, no 1 (décembre 2003) : 239–76. http://dx.doi.org/10.1007/bf02893083.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
31

Prassler, Josef, Stefan Steidl et Stefanie Urlinger. « In vitro affinity maturation of HuCAL antibodies : complementarity determining region exchange and RapMAT technology ». Immunotherapy 1, no 4 (juillet 2009) : 571–83. http://dx.doi.org/10.2217/imt.09.23.

Texte intégral
Résumé :
Monoclonal antibodies gain ever-increasing importance in the treatment of human diseases across a broad range of indications. Diverse technologies currently exist, which are used to generate recombinant therapeutic antibodies that are basically indistinguishable from naturally occurring human immunoglobulins. We describe how human combinatorial antibody libraries are used together with unique optimization techniques to produce such therapeutically relevant proteins, for instance in the areas of oncology and inflammation.
Styles APA, Harvard, Vancouver, ISO, etc.
32

Sanders, Jeremy K. M. « Adventures in molecular recognition. The ins and outs of templating ». Pure and Applied Chemistry 72, no 12 (1 janvier 2000) : 2265–74. http://dx.doi.org/10.1351/pac200072122265.

Texte intégral
Résumé :
Two different approaches are described for the creation of supramolecular systems potentially capable of recognition and catalysis. Using the design approach, we have been able to accelerate and influence two different Diels­Alder reactions within the cavities of porphyrin dimers and trimers; this is templating from the outside inwards. The selection approach is a synthetic chemical attempt to capture some of the key evolutionary features of biological systems: dynamic combinatorial chemistry is used to create equilibrating mixtures of potential receptors, and then a template is used to select and amplify the desired system. Five potential reactions for such dynamic chemistry are discussed: base-catalyzed transesterification, hydrazone exchange, disulfide exchange, alkene metathesis, and Pd-catalyzed allyl exchange, and preliminary templating results (inside outwards) are presented.
Styles APA, Harvard, Vancouver, ISO, etc.
33

ASHWIN, PETER, AREK GOETZ, PEDRO PERES et ANA RODRIGUES. « Embeddings of interval exchange transformations into planar piecewise isometries ». Ergodic Theory and Dynamical Systems 40, no 5 (23 octobre 2018) : 1153–79. http://dx.doi.org/10.1017/etds.2018.112.

Texte intégral
Résumé :
Althoughpiecewise isometries(PWIs) are higher-dimensional generalizations of one-dimensionalinterval exchange transformations(IETs), their generic dynamical properties seem to be quite different. In this paper, we consider embeddings of IET dynamics into PWI with a view to better understanding their similarities and differences. We derive some necessary conditions for existence of such embeddings using combinatorial, topological and measure-theoretic properties of IETs. In particular, we prove that continuous embeddings of minimal 2-IETs into orientation-preserving PWIs are necessarily trivial and that any 3-PWI has at most one non-trivially continuously embedded minimal 3-IET with the same underlying permutation. Finally, we introduce a family of 4-PWIs, with an apparent abundance of invariant non-smooth fractal curves supporting IETs, that limit to a trivial embedding of an IET.
Styles APA, Harvard, Vancouver, ISO, etc.
34

Munarini, Emanuele. « Combinatorial identities involving the central coefficients of a Sheffer matrix ». Applicable Analysis and Discrete Mathematics 13, no 2 (2019) : 495–517. http://dx.doi.org/10.2298/aadm180226017m.

Texte intégral
Résumé :
Given m ? N, m ? 1, and a Sheffer matrix S = [sn,k]n,k?0, we obtain the exponential generating series for the coefficients (a+(m+1)n a+mn)-1 sa+(m+1)n,a+mn. Then, by using this series, we obtain two general combinatorial identities, and their specialization to r-Stirling, r-Lah and r-idempotent numbers. In particular, using this approach, we recover two well known binomial identities, namely Gould's identity and Hagen-Rothe's identity. Moreover, we generalize these results obtaining an exchange identity for a cross sequence (or for two Sheffer sequences) and an Abel-like identity for a cross sequence (or for an s-Appell sequence). We also obtain some new Sheffer matrices.
Styles APA, Harvard, Vancouver, ISO, etc.
35

Ulatowski, Filip, et Janusz Jurczak. « Oligocarboxylates as useful templates in dynamic combinatorial chemistry ». Pure and Applied Chemistry 89, no 6 (27 juin 2017) : 801–7. http://dx.doi.org/10.1515/pac-2016-1027.

Texte intégral
Résumé :
Abstract Dynamic combinatorial chemistry deals with systems (libraries) of multiple compounds formed by reversible reactions. Interactions of all library components with introduced template molecule are reflected in modification of library composition and are analysed simultaneously. In our studies we investigated a single-substrate dynamic combinatorial library of macrocycles, based on dipicolinic acid diamide, with disulphide bond exchange as the reversible reaction. The library components equipped with hydrogen bond donors interact with anionic guests – carboxylates which act as templates inducing amplification of selected library members. We proved that quantitative analysis of interactions with templates is possible, which led us to a novel method of analysis of association constants of static receptors introduced to the system. With a large set of carboxylates differing in number of anionic groups, size, shape, and flexibility of the linker, we proved that the library is very sensitive to structural parameters of the template. We also showed that with mediation of a photoswitchable azobenzene-based template it is possible to change the library composition by light stimulus. Similarly, with mediation of EDTA the library is sensitive to introduction of metal cations.
Styles APA, Harvard, Vancouver, ISO, etc.
36

Ahyaningsih, Faiz. « The Other Assignment For Problem Instances Esc 16b, Esc 16c And Esc 16h ». Talenta Conference Series : Science and Technology (ST) 1, no 1 (17 octobre 2018) : 044–48. http://dx.doi.org/10.32734/st.v1i1.188.

Texte intégral
Résumé :
The quadratic assigment problem (QAP) has remainedone of the great challenges in combinatorial optimization. In this paper I propose two programs, the MATLAB program for solving QAP, and the MATLAB program for checking objective value, if we input an arbitrary permutation, matrix flow and matrix distance. The first program using combination methods that combines random point strategy, forward exchange strategy , and backward exchange strategy. I‘ve tried my program to solve Esc 16b, Esc 16c and Esc 16h from QAPLIB (A Quadratic Assignment Problem Library). In the 500th iteration optimal value reached and I‘ve found the other assignment for problem instances Esc 16b, Esc 16c, and Esc 16h.
Styles APA, Harvard, Vancouver, ISO, etc.
37

Glover, Fred, Gary Kochenberger, Moses Ma et Yu Du. « Quantum Bridge Analytics II : QUBO-Plus, network optimization and combinatorial chaining for asset exchange ». 4OR 18, no 4 (décembre 2020) : 387–417. http://dx.doi.org/10.1007/s10288-020-00464-9.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
38

BARCELO, HÉLÈNE, CHRISTOPHER SEVERS et JACOB A. WHITE. « THE DISCRETE FUNDAMENTAL GROUP OF THE ASSOCIAHEDRON, AND THE EXCHANGE MODULE ». International Journal of Algebra and Computation 23, no 04 (juin 2013) : 745–62. http://dx.doi.org/10.1142/s0218196713400079.

Texte intégral
Résumé :
The associahedron is an object that has been well studied and has numerous applications, particularly in the theory of operads, the study of non-crossing partitions, lattice theory and more recently in the study of cluster algebras. We approach the associahedron from the point of view of discrete homotopy theory. We study the abelianization of the discrete fundamental group, and show that it is free abelian of rank [Formula: see text]. We also find a combinatorial description for a basis of this rank. We also introduce the exchange module of the type An cluster algebra, used to model the relations in the cluster algebra. We use the discrete fundamental group to the study of exchange module, and show that it is also free abelian of rank [Formula: see text].
Styles APA, Harvard, Vancouver, ISO, etc.
39

Hernando, Leticia, Alexander Mendiburu et Jose A. Lozano. « Anatomy of the Attraction Basins : Breaking with the Intuition ». Evolutionary Computation 27, no 3 (septembre 2019) : 435–66. http://dx.doi.org/10.1162/evco_a_00227.

Texte intégral
Résumé :
Solving combinatorial optimization problems efficiently requires the development of algorithms that consider the specific properties of the problems. In this sense, local search algorithms are designed over a neighborhood structure that partially accounts for these properties. Considering a neighborhood, the space is usually interpreted as a natural landscape, with valleys and mountains. Under this perception, it is commonly believed that, if maximizing, the solutions located in the slopes of the same mountain belong to the same attraction basin, with the peaks of the mountains being the local optima. Unfortunately, this is a widespread erroneous visualization of a combinatorial landscape. Thus, our aim is to clarify this aspect, providing a detailed analysis of, first, the existence of plateaus where the local optima are involved, and second, the properties that define the topology of the attraction basins, picturing a reliable visualization of the landscapes. Some of the features explored in this article have never been examined before. Hence, new findings about the structure of the attraction basins are shown. The study is focused on instances of permutation-based combinatorial optimization problems considering the 2-exchange and the insert neighborhoods. As a consequence of this work, we break away from the extended belief about the anatomy of attraction basins.
Styles APA, Harvard, Vancouver, ISO, etc.
40

Schlegel, Jan Christoph. « The structure of equilibria in trading networks with frictions ». Theoretical Economics 17, no 2 (2022) : 801–39. http://dx.doi.org/10.3982/te4405.

Texte intégral
Résumé :
Several structural results for the set of competitive equilibria in trading networks with frictions are established: The lattice theorem, the rural hospitals theorem, the existence of side‐optimal equilibria, and a group‐incentive‐compatibility result hold with imperfectly transferable utility and in the presence of frictions. While our results are developed in a trading network model, they also imply analogous (and new) results for exchange economies with combinatorial demand and for two‐sided matching markets with transfers.
Styles APA, Harvard, Vancouver, ISO, etc.
41

VOGEL, HANNAH, ANNA FELIKSON et PAVEL TUMARKIN. « ASYMPTOTIC TRIANGULATIONS AND COXETER TRANSFORMATIONS OF THE ANNULUS ». Glasgow Mathematical Journal 60, no 1 (27 février 2017) : 63–96. http://dx.doi.org/10.1017/s0017089516000574.

Texte intégral
Résumé :
AbstractAsymptotic triangulations can be viewed as limits of triangulations under the action of the mapping class group. In the case of the annulus, such triangulations have been introduced in K. Baur and G. Dupont (Compactifying exchange graphs: Annuli and tubes, Ann. Comb.3(18) (2014), 797–839). We construct an alternative method of obtaining these asymptotic triangulations using Coxeter transformations. This provides us with an algebraic and combinatorial framework for studying these limits via the associated quivers.
Styles APA, Harvard, Vancouver, ISO, etc.
42

Dickopf, Steffen, Can Buldun, Vedran Vasic, Guy Georges, Carina Hage, Klaus Mayer, Matthias Forster et al. « Prodrug-Activating Chain Exchange (PACE) converts targeted prodrug derivatives to functional bi- or multispecific antibodies ». Biological Chemistry 403, no 5-6 (20 janvier 2022) : 495–508. http://dx.doi.org/10.1515/hsz-2021-0401.

Texte intégral
Résumé :
Abstract Driven by the potential to broaden the target space of conventional monospecific antibodies, the field of multi-specific antibody derivatives is growing rapidly. The production and screening of these artificial proteins entails a high combinatorial complexity. Antibody-domain exchange was previously shown to be a versatile strategy to produce bispecific antibodies in a robust and efficient manner. Here, we show that the domain exchange reaction to generate hybrid antibodies also functions under physiological conditions. Accordingly, we modified the exchange partners for use in therapeutic applications, in which two inactive prodrugs convert into a product with additional functionalities. We exemplarily show the feasibility for generating active T cell bispecific antibodies from two inactive prodrugs, which per se do not activate T cells alone. The two complementary prodrugs harbor antigen-targeting Fabs and non-functional anti-CD3 Fvs fused to IgG-CH3 domains engineered to drive chain-exchange reactions between them. Importantly, Prodrug-Activating Chain Exchange (PACE) could be an attractive option to conditionally activate therapeutics at the target site. Several examples are provided that demonstrate the efficacy of PACE as a new principle of cancer immunotherapy in vitro and in a human xenograft model.
Styles APA, Harvard, Vancouver, ISO, etc.
43

Folikumah, Makafui Y., Marc Behl et Andreas Lendlein. « Reaction behaviour of peptide-based single thiol-thioesters exchange reaction substrate in the presence of externally added thiols ». MRS Communications 11, no 4 (14 juillet 2021) : 402–10. http://dx.doi.org/10.1557/s43579-021-00041-z.

Texte intégral
Résumé :
Abstract Identification of patterns in chemical reaction pathways aids in the effective design of molecules for specific applications. Here, we report on model reactions with a water-soluble single thiol-thioester exchange (TTE) reaction substrate, which was designed taking in view biological and medical applications. This substrate consists of the thio-depsipeptide, Ac-Pro-Leu-Gly-SLeu-Leu-Gly-NEtSH (TDP) and does not yield foul-smelling thiol exchange products when compared with aromatic thiol containing single TTE substrates. TDP generates an α,ω-dithiol crosslinker in situ in a ‘pseudo intramolecular’ TTE. Competitive intermolecular TTE of TDP with externally added “basic” thiols increased the crosslinker concentration whilst “acidic” thiols decreased its concentration. TDP could potentially enable in situ bioconjugation and crosslinking applications. Graphic abstract The competition between ‘pseudo intramolecular’ and intermolecular exchange of a peptide-based thiol-thioester exchange (TTE) substrate can be used to control the relative amount of final exchange products based on size and pKa values of externally added thiols. Potential application of this system can be seen in the development of TTE substrates for the rapid identification of thiols by dynamic combinatorial screening.
Styles APA, Harvard, Vancouver, ISO, etc.
44

Rosenbaum, Daniel M., Sushmita Roy et Michael H. Hecht. « Screening Combinatorial Libraries of de Novo Proteins by Hydrogen−Deuterium Exchange and Electrospray Mass Spectrometry ». Journal of the American Chemical Society 121, no 41 (octobre 1999) : 9509–13. http://dx.doi.org/10.1021/ja991843x.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
45

Wessjohann, Ludger A., Daniel G. Rivera et Fredy León. « Freezing Imine Exchange in Dynamic Combinatorial Libraries with Ugi Reactions : Versatile Access to Templated Macrocycles ». Organic Letters 9, no 23 (novembre 2007) : 4733–36. http://dx.doi.org/10.1021/ol7021033.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
46

Sghir, Ines, Ines Ben Jaafar et Khaled Ghédira. « A Multi-Agent Based Optimization Method for Combinatorial Optimization Problems ». International Journal on Artificial Intelligence Tools 27, no 05 (août 2018) : 1850021. http://dx.doi.org/10.1142/s0218213018500215.

Texte intégral
Résumé :
This paper introduces a Multi-Agent based Optimization Method for Combinatorial Optimization Problems named MAOM-COP. In this method, a set of agents are cooperatively interacting to select the appropriate operators of metaheuristics using learning techniques. MAOM-COP is a flexible architecture, whose objective is to produce more generally applicable search methodologies. In this paper, the MAOM-COP explores genetic algorithm and local search metaheuristics. Using these metaheuristics, the decision-maker agent, the intensification agents and the diversification agents are seeking to improve the search. The diversification agents can be divided into the perturbation agent and the crossover agents. The decision-maker agent decides dynamically which agent to activate between intensification agents and crossover agents within reinforcement learning. If the intensification agents are activated, they apply local search algorithms. During their searches, they can exchange information, as they can trigger the perturbation agent. If the crossover agents are activated, they perform recombination operations. We applied the MAOM-COP to the following problems: quadratic assignment, graph coloring, winner determination and multidimensional knapsack. MAOMCOP shows competitive performances compared with the approaches of the literature.
Styles APA, Harvard, Vancouver, ISO, etc.
47

Milgrom, Paul. « Auction Market Design : Recent Innovations ». Annual Review of Economics 11, no 1 (2 août 2019) : 383–405. http://dx.doi.org/10.1146/annurev-economics-080218-025818.

Texte intégral
Résumé :
Market design applies economic principles to the often messy problems of real-world exchange in which goods may not be homogeneous, the identities of trading partners may matter, contracts may not be executed, and even the formulation of trade as balancing supply and demand may be unhelpful. This article recounts the mostly academic research advancing the analysis and design of such markets. Among the highlighted applications are ones involving financial markets, Internet advertising, electricity auctions, spectrum auctions, cryptocurrencies, and combinatorial procurements.
Styles APA, Harvard, Vancouver, ISO, etc.
48

Derinkuyu, Kursad, Fehmi Tanrisever, Nermin Kurt et Gokhan Ceyhan. « Optimizing Day-Ahead Electricity Market Prices : Increasing the Total Surplus for Energy Exchange Istanbul ». Manufacturing & ; Service Operations Management 22, no 4 (juillet 2020) : 700–716. http://dx.doi.org/10.1287/msom.2018.0767.

Texte intégral
Résumé :
Problem definition: We design a combinatorial auction to clear the Turkish day-ahead electricity market, and we develop effective tabu search and genetic algorithms to solve the problem of matching bidders and maximizing social welfare within a reasonable amount of time for practical purposes. Academic/practical relevance: A double-sided blind combinatorial auction is used to determine electricity prices for day-ahead markets in Europe. Considering the integer requirements associated with market participants’ bids and the nonlinear social welfare objective, a complicated problem arises. In Turkey, the total number of bids reaches 15,000, and this large problem needs to be solved within minutes every day. Given the practical time limit, solving this problem with standard optimization packages is not guaranteed, and therefore, heuristic algorithms are needed to quickly obtain a high-quality solution. Methodology: We use nonlinear mixed-integer programming and tabu search and genetic algorithms. We analyze the performance of our algorithms by comparing them with solutions commercially available to the market operator. Results: We provide structural results to reduce the problem size and then develop customized heuristics by exploiting the problem structure in the day-ahead market. Our algorithms are guaranteed to generate a feasible solution, and Energy Exchange Istanbul has been using them since June 2016, increasing its surplus by 448,418 Turkish liras (US$128,119) per day and 163,672,570 Turkish liras (US$46,763,591) per year, on average. We also establish that genetic algorithms work better than tabu search for the Turkish day-ahead market. Managerial implications: We deliver a practical tool using innovative optimization techniques to clear the Turkish day-ahead electricity market. We also modify our model to handle similar European day-ahead markets and show that performances of our heuristics are robust under different auction designs.
Styles APA, Harvard, Vancouver, ISO, etc.
49

Hsu, Eric, et Sheila McIlraith. « Computing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound Search ». Proceedings of the International Symposium on Combinatorial Search 1, no 1 (25 août 2010) : 111–12. http://dx.doi.org/10.1609/socs.v1i1.18180.

Texte intégral
Résumé :
Branch-and-Bound search is a basic algorithm for solving combinatorial optimization problems. Here we introduce a new lower-bounding methodology that can be incorporated into any branch-and-bound solver, and demonstraint its use on the MaxSAT constraint optimization problem. The approach is to adapt a “minimum-height equivalent transformation” framework that was first developed in the context of computer vision. We present efficient algorithms to realize this framework within the MaxSAT domain, and demonstrate their feasibility by implementing them within the state-of-the-art maxsatz solver. We evaluate the solver on test sets from the 2009 MaxSAT competition; we observe a basic performance tradeoff whereby the (quadratic) time cost of computing the transformations may or may not be worthwhile in exchange for better bounds and more frequent pruning. For specific test sets, the trade-off does result in significant improvement in both prunings and overall run-time.
Styles APA, Harvard, Vancouver, ISO, etc.
50

Napolitano, Roberta, Todd C. Soesbe, Luis M. De León-Rodríguez, A. Dean Sherry et D. Gomika Udugamasooriya. « On-Bead Combinatorial Synthesis and Imaging of Chemical Exchange Saturation Transfer Magnetic Resonance Imaging Agents To Identify Factors That Influence Water Exchange ». Journal of the American Chemical Society 133, no 33 (24 août 2011) : 13023–30. http://dx.doi.org/10.1021/ja201123f.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie