Thematische Bibliographien / Combinatorial exploration

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Combinatorial exploration“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Combinatorial exploration" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Combinatorial exploration"

Levin, M. Sh. „Combinatorial planning framework for geological exploration“. Information Processes 21, Nr. 1 (2021): 65–81. http://dx.doi.org/10.53921/18195822_2021_21_1_65.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Urata, Saori, Masaaki Kitawaki und Ryoji Funahashi. „Exploration of Thermoelectric Oxides by Combinatorial Chemistry“. Journal of the Japan Society of Powder and Powder Metallurgy 50, Nr. 6 (2003): 490–94. http://dx.doi.org/10.2497/jjspm.50.490.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Takahashi, Ryota, und Kazuhiro Kawashima. „Combinatorial High-throughput Exploration of Functional Materials“. Materia Japan 60, Nr. 10 (01.10.2021): 620–27. http://dx.doi.org/10.2320/materia.60.620.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ben-David, Noa, und Sivan Sabato. „A Fast Algorithm for PAC Combinatorial Pure Exploration“. Proceedings of the AAAI Conference on Artificial Intelligence 36, Nr. 6 (28.06.2022): 6064–71. http://dx.doi.org/10.1609/aaai.v36i6.20553.

Der volle Inhalt der Quelle

Annotation:

We consider the problem of Combinatorial Pure Exploration (CPE), which deals with finding a combinatorial set of arms with a high reward, when the rewards of individual arms are unknown in advance and must be estimated using arm pulls. Previous algorithms for this problem, while obtaining sample complexity reductions in many cases, are highly computationally intensive, thus making them impractical even for mildly large problems. In this work, we propose a new CPE algorithm in the PAC setting, which is computationally light weight, and so can easily be applied to problems with tens of thousands of arms. This is achieved since the proposed algorithm requires a very small number of combinatorial oracle calls. The algorithm is based on successive acceptance of arms, along with elimination which is based on the combinatorial structure of the problem. We provide sample complexity guarantees for our algorithm, and demonstrate in experiments its usefulness on large problems, whereas previous algorithms are impractical to run on problems of even a few dozen arms. The code is provided at https://github.com/noabdavid/csale. The full version of this paper is available at https://arxiv.org/abs/2112.04197.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Qun Jiao, und Min Xu. „Combinatorial Synthesis and Evaluation on Thermoelectric Films“. Materials Science Forum 687 (Juni 2011): 591–95. http://dx.doi.org/10.4028/www.scientific.net/msf.687.591.

Der volle Inhalt der Quelle

Annotation:

Combinatorial technology is a powerful tool for new material exploration. Some new combinatorial technologies, such as combinatorial laser molecular beam epitaxy (CLMBE) and combinatorial pulsed laser deposition (CPLD), were introduced in the paper. La1-xCexVO3 (0≤x≤1) composition-spread films were fabricated successfully by CPLD, while their thermoelectric properties and structures were evaluated by the multi-channel thermoelectric measurement system and concurrent X-ray analysis respectively. Combinatorial technologies are proving to be an efficient, low-cost tool in synthesis and characterization of thermoelectric composition-spread films.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Orner, Brendan P., Ratmir Derda, Rachel L. Lewis, James A. Thomson und Laura L. Kiessling. „Arrays for the Combinatorial Exploration of Cell Adhesion“. Journal of the American Chemical Society 126, Nr. 35 (September 2004): 10808–9. http://dx.doi.org/10.1021/ja0474291.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Liu, Jingbei, Yanhui Liu, Pan Gong, Yanglin Li, Kimberly M. Moore, Ellen Scanley, Fred Walker, Christine C. Broadbridge und Jan Schroers. „Combinatorial exploration of color in gold-based alloys“. Gold Bulletin 48, Nr. 3-4 (28.08.2015): 111–18. http://dx.doi.org/10.1007/s13404-015-0167-z.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

ROWELL, MICHAEL. „A NEW EXPLORATION OF THE LEBESGUE IDENTITY“. International Journal of Number Theory 06, Nr. 04 (Juni 2010): 785–98. http://dx.doi.org/10.1142/s1793042110003204.

Der volle Inhalt der Quelle

Annotation:

We introduce a new combinatorial proof of the Lebesgue identity which allows us to find a new finite form of the identity. Using this new finite form we are able to make new observations about special cases of the Lebesgue identity, namely the "little" Göllnitz theorems and Sylvester's identity.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Brütting, Jan, Patrick Ole Ohlbrock, Julian Hofer und Pierluigi D’Acunto. „Stock-constrained truss design exploration through combinatorial equilibrium modeling“. International Journal of Space Structures 36, Nr. 4 (Dezember 2021): 253–69. http://dx.doi.org/10.1177/09560599211064100.

Der volle Inhalt der Quelle

Annotation:

Reusing structural components has potential to reduce environmental impacts of building structures because it reduces new material use, energy consumption, and waste. When designing structures through reuse, available element characteristics become a design input. This paper presents a new computational workflow to design structures made of reused and new elements. The workflow combines Combinatorial Equilibrium Modeling, efficient Best-Fit heuristics, and Life Cycle Assessment to explore different design options in a user-interactive way and with almost real-time feedback. The method applicability is demonstrated by a realistic case study. Results show that structures combining reused and new elements have a significantly lower environmental impact than solutions made of new material only.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Du, Yihan, Yuko Kuroki und Wei Chen. „Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback“. Proceedings of the AAAI Conference on Artificial Intelligence 35, Nr. 8 (18.05.2021): 7262–70. http://dx.doi.org/10.1609/aaai.v35i8.16892.

Der volle Inhalt der Quelle

Annotation:

In this paper, we first study the problem of combinatorial pure exploration with full-bandit feedback (CPE-BL), where a learner is given a combinatorial action space X \subseteq {0,1}^d, and in each round the learner pulls an action x \in X and receives a random reward with expectation x^T \theta, with \theta \in \R^d a latent and unknown environment vector. The objective is to identify the optimal action with the highest expected reward, using as few samples as possible. For CPE-BL, we design the first polynomial-time adaptive algorithm, whose sample complexity matches the lower bound (within a logarithmic factor) for a family of instances and has a light dependence of \Delta_min (the smallest gap between the optimal action and sub-optimal actions). Furthermore, we propose a novel generalization of CPE-BL with flexible feedback structures, called combinatorial pure exploration with partial linear feedback (CPE-PL), which encompasses several families of sub-problems including full-bandit feedback, semi-bandit feedback, partial feedback and nonlinear reward functions. In CPE-PL, each pull of action x reports a random feedback vector with expectation of M_x \theta , where M_x \in R^{m_x \times d} is a transformation matrix for x, and gains a random (possibly nonlinear) reward related to x. For CPE-PL, we develop the first polynomial-time algorithm, which simultaneously addresses limited feedback, general reward function and combinatorial action space (e.g., matroids, matchings and s-t paths), and provide its sample complexity analysis. Our empirical evaluation demonstrates that our algorithms run orders of magnitude faster than the existing ones, and our CPE-BL algorithm is robust across different \Delta_min settings while our CPE-PL algorithm is the first one returning correct answers for nonlinear reward functions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Combinatorial exploration"

Janiszewski, Susan. „An Exploration Into Two Combinatorial Problems“. ScholarWorks @ UVM, 2008. http://scholarworks.uvm.edu/graddis/116.

Der volle Inhalt der Quelle

Annotation:

Tom Johnson is an American musician and composer living in Paris who regularly composes pieces based on combinatorial designs. He recently posed the following question: is there a way to construct five Room squares of side seven such that each of the thirty-five possible fill patterns is used exactly once? In this thesis we study his question and several related questions concerning the possible fill patterns in sets of Room squares of side 7 and 11. The second problem addressed in this thesis is a conjecture by Marco Buratti, a combinatorialist from the Universitia di Perusia, Italy. He conjectured that given p a prime and a multiset S containing p - 1 non-zero elements from Zp, there exists a Hamiltonian path in Kp where the multiset of edge lengths is S. Part of the motivation behind studying this particular problem is the possible application to constructing cyclic combinatorial designs. In this thesis we completely solve the case where S contains at most two distinct values.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lam, Matthew. „A Combinatorial Exploration of Elliptic Curves“. Scholarship @ Claremont, 2015. http://scholarship.claremont.edu/hmc_theses/91.

Der volle Inhalt der Quelle

Annotation:

At the intersection of algebraic geometry, number theory, and combinatorics, an interesting problem is counting points on an algebraic curve over a finite field. When specialized to the case of elliptic curves, this question leads to a surprising connection with a particular family of graphs. In this document, we present some of the underlying theory and then summarize recent results concerning the aforementioned relationship between elliptic curves and graphs. A few results are additionally further elucidated by theory that was omitted in their original presentation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bunyapaiboonsri, Taridaporn. „Dynamic combinatorial chemistry : Exploration using biological receptors“. Université Louis Pasteur (Strasbourg) (1971-2008), 2003. http://www.theses.fr/2003STR13065.

Der volle Inhalt der Quelle

Annotation:

La chimie combinatoire dynamique a été récemment introduite comme une approche nouvelle et attractive pour générer et cribler un grand nombre de bibliothèques de composés en une seule étape. Basé sur l'interconnexion réversible entre les composés de la bibliothèque, le processus d'auto-ajustement donne accès à la sélection et à l'amplification du meilleur inhibiteur en présence d'une cible. Au cours de cette thèse, nous avons choisi deux cibles biologiques qui nous ont permis d'explorer l'approche de la chimie combinatoire dynamique. La réversibilité du système a été rendue possible en utilisant l'échange de disulfures ou la formation réversible d'acyl hydrazones. Premièrement, une bibliothèque dynamique d'inhibiteurs d'acétylcholinestérase a été générée grâce à l'échange de disulfures. Nous avons observé la réversibilité du système à l'aide de la spectroscopie de RMN. A partir d'un mélange initial de 5 homodisulfures en présence d'un agent réducteur, une bibliothèque contenant 15 composantes a été obtenue. Les composantes de cette bibliothèque ont été mises en évidence par SM-ES et par EC. Deuxièmement, une bibliothèque combinatoire dynamique d'inhibiteurs d'acétylcholinesterase a été générée en se basant sur la formation réversible d'acyl-hydrazones. Le processus pré-équilibré a été utilisé pour obtentir d'une bibliothèque dynamique composée de 66 espèces possibles, à partir de 13 unités de bases. Nous avons ensuite identifié l'inhibiteur très puissant (IC50 et Ki de l'ordre de nM), en utilisant la méthode de la déconvolution dynamique. Finalement, le processus pré-équilibré combiné à la technique de la déconvolution dynamique a été employé pour identifier les inhibiteurs de la HPr kinase/phosphatase. Ainsi, nous avons pu préparer une bibliothèque dynamique constituée de 440 composés possibles, en une seule étape, à partir de 21 unités de bases. Le ligand hétérocyclique bis-cationique s'est révélé un inhibiteur relativement puissant (IC50 de l'ordre de mM)
Dynamic combinatorial chemistry (DCC) has recently been introduced as a new and attractive approach for generating and screening large numbers of library compounds in one step. Based upon the reversible interconnection between library components, the self-adjusting process give access to selection and amplification of the best binder in the presence of a target. In this thesis, two biological targets were chosen to explore the DCC approach. The reversibility of the system was achieved using disulfide interchange or reversible acyl hydrazone formation. Firstly, a dynamic library of acetylcholinesterase inhibitors was generated through disulfide exchange. The reversibility of the system was observed by NMR spectroscopy. Upon scrambling 5 initial homodisulfides in the presence of a reducing agent, a 15-compound library was produced. The library components were analyzed by ESI-MS and CE. Secondly, a dynamic combinatorial library of acetylcholinesterase inhibitors was further generated through reversible acyl hydrazone formation. The pre-equilibrated process was applied to produce a dynamic library composed of 66 possible species, from a set of 13 initial aldehyde and hydrazide building blocks. Using a technique called dynamic deconvolution, a highly potent inhibitor was identified with IC50 in the nanomolar range. Finally, the pre-equilibrated process combined with the dynamic deconvolution technique was further studied to identify HPr kinase/phosphatase inhibitors. From a set of 21 initial aldehyde and hydrazide builiding blocks, a dynamic library of 440 possible compounds was formed in one operation. A bis-cationic heterocyclic ligand was identified as a relatively potent inhibitor, displaying an IC50 in the micromolar range

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lin, Chuan-Lan. „Combinatorial exploration of artificial multiferroic thin films“. College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/1465.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.S.) -- University of Maryland, College Park, 2004.
Thesis research directed by: Dept. of Materials Science and Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Savovic, Jelena. „Exploration of dynamic combinatorial chemistry in enzyme-inhibitor discovery“. Thesis, University of Bath, 2003. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.760840.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Patel, Chirag B. „A multi-objective stochastic approach to combinatorial technology space exploration“. Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29647.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph.D)--Aerospace Engineering, Georgia Institute of Technology, 2009.
Committee Chair: Dr. Dimitri N. Mavris; Committee Member: Dr. Brian J. German; Committee Member: Dr. Daniel P. Schrage; Committee Member: Dr. Frederic Villeneuve; Committee Member: Dr. Michelle R. Kirby; Committee Member: Ms. Antje Lembcke. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chang, Teng-Wen. „Geometric typed feature structures : toward design space exploration /“. Title page, contents and abstract only, 1999. http://web4.library.adelaide.edu.au/theses/09PH/09phc4569.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Beeren, Sophie Rachel. „Exploration of ferrocene-containing anion receptors using hydrazone-based dynamic combinatorial libraries“. Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609252.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jelfs, Stephen Philip. „Development of a novel descriptor targeted to high-throughput analysis in lead exploration and combinatorial library design“. Thesis, University of Sheffield, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.412787.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Özlük, Ali Cemal. „Design Space Exploration for Building Automation Systems“. Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-130600.

Der volle Inhalt der Quelle

Annotation:

In the building automation domain, there are gaps among various tasks related to design engineering. As a result created system designs must be adapted to the given requirements on system functionality, which is related to increased costs and engineering effort than planned. For this reason standards are prepared to enable a coordination among these tasks by providing guidelines and unified artifacts for the design. Moreover, a huge variety of prefabricated devices offered from different manufacturers on the market for building automation that realize building automation functions by preprogrammed software components. Current methods for design creation do not consider this variety and design solution is limited to product lines of a few manufacturers and expertise of system integrators. Correspondingly, this results in design solutions of a limited quality. Thus, a great optimization potential of the quality of design solutions and coordination of tasks related to design engineering arises. For given design requirements, the existence of a high number of devices that realize required functions leads to a combinatorial explosion of design alternatives at different price and quality levels. Finding optimal design alternatives is a hard problem to which a new solution method is proposed based on heuristical approaches. By integrating problem specific knowledge into algorithms based on heuristics, a promisingly high optimization performance is achieved. Further, optimization algorithms are conceived to consider a set of flexibly defined quality criteria specified by users and achieve system design solutions of high quality. In order to realize this idea, optimization algorithms are proposed in this thesis based on goal-oriented operations that achieve a balanced convergence and exploration behavior for a search in the design space applied in different strategies. Further, a component model is proposed that enables a seamless integration of design engineering tasks according to the related standards and application of optimization algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Combinatorial exploration"

Symposium: The Exploration of Sequence Space Selecting Functions Molecules from Combinatorial Libraries. PN, 1997.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Combinatorial exploration"

Walshaw, Chris. „An Exploration of Multilevel Combinatorial Optimisation“. In Combinatorial Optimization, 71–123. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4757-3748-6_2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dhar, Amit Kumar, Barun Gorain, Kaushik Mondal, Shaswati Patra und Rishi Ranjan Singh. „Edge Exploration of a Graph by Mobile Agent“. In Combinatorial Optimization and Applications, 142–54. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36412-0_12.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Li, Xiaoya, und Jinchuan Cui. „Real-Time Algorithm Scheme for n-Vehicle Exploration Problem“. In Combinatorial Optimization and Applications, 287–300. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02026-1_27.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Beling, Piotr, Piotr Cybula, Andrzej Jaszkiewicz, Przemysław Pełka, Marek Rogalski und Piotr Sielski. „Deep Infeasibility Exploration Method for Vehicle Routing Problems“. In Evolutionary Computation in Combinatorial Optimization, 62–78. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-04148-8_5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dall’Asta, Luca, Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vázquez und Alessandro Vespignani. „Traceroute-Like Exploration of Unknown Networks: A Statistical Analysis“. In Combinatorial and Algorithmic Aspects of Networking, 140–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11527954_13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Antipov, Denis, Maxim Buzdalov und Benjamin Doerr. „Runtime Analysis of $$(1+1)$$ Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem“. In Evolutionary Computation in Combinatorial Optimization, 160–72. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-16468-7_14.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Goodnow, Robert A. „The Changing Feasibility and Economics of Chemical Diversity Exploration with DNA-Encoded Combinatorial Approaches“. In A Handbook for DNA-Encoded Chemistry, 417–26. Hoboken, NJ: John Wiley & Sons, Inc., 2014. http://dx.doi.org/10.1002/9781118832738.ch18.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Riedelbauch, Dominik, und Sascha Sucker. „Visual Programming of Robot Tasks with Product and Process Variety“. In Annals of Scientific Society for Assembly, Handling and Industrial Robotics 2022, 241–52. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-10071-0_20.

Der volle Inhalt der Quelle

Annotation:

AbstractIn flexible manufacturing settings, automation is shaped by ever changing conditions (e.g. varying part feeding locations, highly customizable products). Quick adaptation of robot systems is mostly achieved by visual end-user robot (re-)programming. In this paper, we discuss the explicit integration of anticipated product and process variety into visually programmed tasks. We contribute a task model which captures a user-defined range of task variants. To this end, parts are specified in terms of approximate locations and generalized parts families. Workspace exploration and combinatorial assignment planning enable online adaptation to unknown environments. Our experiments show that this adaptation capability can increase the economical efficiency of cobot use.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Majumdar, Rupak, Aman Mathur, Marcus Pirron, Laura Stegner und Damien Zufferey. „Paracosm: A Test Framework for Autonomous Driving Simulations“. In Fundamental Approaches to Software Engineering, 172–95. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71500-7_9.

Der volle Inhalt der Quelle

Annotation:

AbstractSystematic testing of autonomous vehicles operating in complex real-world scenarios is a difficult and expensive problem. We present Paracosm, a framework for writing systematic test scenarios for autonomous driving simulations. Paracosm allows users to programmatically describe complex driving situations with specific features, e.g., road layouts and environmental conditions, as well as reactive temporal behaviors of other cars and pedestrians. A systematic exploration of the state space, both for visual features and for reactive interactions with the environment is made possible. We define a notion of test coverage for parameter configurations based on combinatorial testing and low dispersion sequences. Using fuzzing on parameter configurations, our automatic test generator can maximize coverage of various behaviors and find problematic cases. Through empirical evaluations, we demonstrate the capabilities of Paracosm in programmatically modeling parameterized test environments, and in finding problematic scenarios.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kumar, Anish, B. S. Bhadauria, Brijesh Kumar Singh und Awanish Kumar. „The Combinatorial Impact of Through-Flow and G-Jitter on Instability Exploration of a Rotating Layer of Nano-Liquid with the Magnetic Field“. In Advances in Mathematical Modelling, Applied Analysis and Computation, 343–67. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-56307-2_22.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Combinatorial exploration"

Cavalcante, Rodolfo C., Thiago F. Noronha und Luiz Chaimowicz. „Improving combinatorial auctions for multi-robot exploration“. In 2013 16th International Conference on Advanced Robotics (ICAR 2013). IEEE, 2013. http://dx.doi.org/10.1109/icar.2013.6766508.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Downey, K. E., R. B. van Dover, A. Bhagwat und A. Gaeta. „Combinatorial exploration of novel thin film amorphous oxides“. In 2005 Conference on Lasers and Electro-Optics (CLEO). IEEE, 2005. http://dx.doi.org/10.1109/cleo.2005.201682.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fukumura, T. „High throughput combinatorial materials Exploration for advanced magneto-electronics“. In 2009 International Conference on Solid State Devices and Materials. The Japan Society of Applied Physics, 2009. http://dx.doi.org/10.7567/ssdm.2009.h-3-1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baste, Julien, Michael R. Fellows, Lars Jaffke, Tomáš Masařík, Mateus de Oliveira Oliveira, Geevarghese Philip und Frances A. Rosamond. „Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory“. In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/156.

Der volle Inhalt der Quelle

Annotation:

When modeling an application of practical relevance as an instance of a combinatorial problem X, we are often interested not merely in finding one optimal solution for that instance, but in finding a sufficiently diverse collection of good solutions. In this work we initiate a systematic study of diversity from the point of view of fixed-parameter tractability theory. We consider an intuitive notion of diversity of a collection of solutions which suits a large variety of combinatorial problems of practical interest. Our main contribution is an algorithmic framework which --automatically-- converts a tree-decomposition-based dynamic programming algorithm for a given combinatorial problem X into a dynamic programming algorithm for the diverse version of X. Surprisingly, our algorithm has a polynomial dependence on the diversity parameter.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gupta, Rohan, und Raju Pal. „Biogeography-Based Optimization with LéVY-Flight Exploration for Combinatorial Optimization“. In 2018 8th International Conference on Cloud Computing, Data Science & Engineering (Confluence). IEEE, 2018. http://dx.doi.org/10.1109/confluence.2018.8442942.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hossain, Fahmida, Md Shamsujjoha und Md Nawab Yousuf Ali. „Biological and combinatorial problems exploration using parallel and evolutionary computing“. In 2016 14th International Conference on ICT and Knowledge Engineering (ICT&KE). IEEE, 2016. http://dx.doi.org/10.1109/ictke.2016.7804095.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Huang, Weiran, Jungseul Ok, Liang Li und Wei Chen. „Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications“. In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/317.

Der volle Inhalt der Quelle

Annotation:

We study the Combinatorial Pure Exploration problem with Continuous and Separable reward functions (CPE-CS) in the stochastic multi-armed bandit setting. In a CPE-CS instance, we are given several stochastic arms with unknown distributions, as well as a collection of possible decisions. Each decision has a reward according to the distributions of arms. The goal is to identify the decision with the maximum reward, using as few arm samples as possible. The problem generalizes the combinatorial pure exploration problem with linear rewards, which has attracted significant attention in recent years. In this paper, we propose an adaptive learning algorithm for the CPE-CS problem, and analyze its sample complexity. In particular, we introduce a new hardness measure called the consistent optimality hardness, and give both the upper and lower bounds of sample complexity. Moreover, we give examples to demonstrate that our solution has the capacity to deal with non-linear reward functions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chikyow, Toyohiro, Ken Hasegawa, Tae Tamori, Kenji Ohmori, Naoto Umezawa, Kiyomi Nakajima, Keisaku Yamada und Hideomi Koinuma. „Combinatorial materials exploration and composition tuning for the future gate stack structure“. In 2006 8th International Conference on Solid-State and Integrated Circuit Technology Proceedings. IEEE, 2006. http://dx.doi.org/10.1109/icsict.2006.306265.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ahmadi-Moshkenani, Parisa, Tor Arne Johansen und Sorin Olaru. „On degeneracy in exploration of combinatorial tree in multi-parametric quadratic programming“. In 2016 IEEE 55th Conference on Decision and Control (CDC). IEEE, 2016. http://dx.doi.org/10.1109/cdc.2016.7798609.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhou, Youjia, Jānis Lazovskis, Michael J. Catanzaro, Matthew Zabka und Bei Wang. „Combinatorial Exploration of Morse–Smale Functions on the Sphere via Interactive Visualization“. In 2023 Topological Data Analysis and Visualization (TopoInVis). IEEE, 2023. http://dx.doi.org/10.1109/topoinvis60193.2023.00012.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!