Gotowe bibliografie tematyczne / ABC-Problem

Gotowa bibliografia na temat „ABC-Problem”

Autor: Grafiati

Data publikacji: 25 maja 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Książki
Części książek
Streszczenia konferencji
Raporty organizacyjne

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „ABC-Problem”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "ABC-Problem"

Chow, Ho Yoong, Sulaiman Hasan i Salleh Ahmad Bareduan. "Basic Concept of Implementing Artificial Bee Colony (ABC) System in Flow Shop Scheduling". Applied Mechanics and Materials 315 (kwiecień 2013): 385–88. http://dx.doi.org/10.4028/www.scientific.net/amm.315.385.

Pełny tekst źródła

Streszczenie:

Flow shop scheduling is a common operational problem in a production system. Effective flow shop scheduling can help the company to improve the management system, hence increase income. Artificial Bee Colony (ABC) is a system that is widely used for scheduling optimization in a production system since 2005. However, the fundamental ABC system uses a heuristic approach to obtain an optimum solution which may not be the optimum solution at all. The ABC system is tested on the speed to obtain the optimum solution for a flowshop scheduling problem and measures the applicability of the schedule in terms of makespan. A simple model of ABC algorithm was developed to identify the effectiveness of the ABC for solving flow shop scheduling problem compared to other established methods. Result shows the ABC model is capable of producing best makespan in flow shop problem tested.

Style APA, Harvard, Vancouver, ISO itp.

Salhi, Souheil, Djemai Naimi, Ahmed Salhi, Saleh Abujarad i Abdelouahab Necira. "A novel hybrid approach based artificial bee colony and salp swarm algorithms for solving ORPD problem". Indonesian Journal of Electrical Engineering and Computer Science 23, nr 3 (1.09.2021): 1825. http://dx.doi.org/10.11591/ijeecs.v23.i3.pp1825-1837.

Pełny tekst źródła

Streszczenie:

Optimal reactive power dispatch (ORPD) is an important task for achieving more economical, secure and stable state of the electrical power system. It is expressed as a complex optimization problem where many meta-heuristic techniques have been proposed to overcome various complexities in solving ORPD problem. A meta-heuristic search mechanism is characterized by exploration and exploitation of the search space. The balance between these two characteristics is a challenging problem to attain the best solution quality. The artificial bee colony (ABC) algorithm as a reputed meta-heuristic has proved its goodness at exploration and weakness at exploitation where the enhancement of the basic ABC version becomes necessary. Salp swarm algorithm (SSA) is a newly developed swarm-based meta-heuristic, which has the best local search capability by using the best global solution in each iteration to discover promising solutions. In this paper, a novel hybrid approach-based ABC and SSA algorithms (ABC-SSA) is that developed to enhance the exploitation capability of the ABC algorithm using SSA and applied for solving ORPD problem. The efficiency of ABC-SSA is investigated using two standard test systems IEEE-30 and IEEE-300 buses, and that by considering the famous objective functions in ORPD problem.

Style APA, Harvard, Vancouver, ISO itp.

Kim, Junghoon, Kaiyu Feng, Gao Cong, Diwen Zhu, Wenyuan Yu i Chunyan Miao. "ABC". Proceedings of the VLDB Endowment 15, nr 10 (czerwiec 2022): 2134–47. http://dx.doi.org/10.14778/3547305.3547318.

Pełny tekst źródła

Streszczenie:

Finding a set of co-clusters in a bipartite network is a fundamental and important problem. In this paper, we present the Attributed Bipartite Co-clustering (ABC) problem which unifies two main concepts: (i) bipartite modularity optimization, and (ii) attribute cohesiveness. To the best of our knowledge, this is the first work to find co-clusters while considering the attribute cohesiveness. We prove that ABC is NP-hard and is not in APX, unless P=NP. We propose three algorithms: (1) a top-down algorithm; (2) a bottom-up algorithm; (3) a group matching algorithm. Extensive experimental results on real-world attributed bipartite networks demonstrate the efficiency and effectiveness of our algorithms.

Style APA, Harvard, Vancouver, ISO itp.

Ying Xiao i Yilong Lu. "Combination of PML and ABC for scattering problem". IEEE Transactions on Magnetics 37, nr 5 (2001): 3510–13. http://dx.doi.org/10.1109/20.952649.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Yang, Weihong, i Zhili Pei. "Hybrid ABC/PSO to solve travelling salesman problem". International Journal of Computing Science and Mathematics 4, nr 3 (2013): 214. http://dx.doi.org/10.1504/ijcsm.2013.057246.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Odanaka, T., i T. Tanaka. "On ABC analysis of multi-item inventory problem". Mathematical Modelling 8 (1987): 725–28. http://dx.doi.org/10.1016/0270-0255(87)90678-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Khan, Indadul, Manas Kumar Maiti i Krishnendu Basuli. "Multi-objective traveling salesman problem: an ABC approach". Applied Intelligence 50, nr 11 (6.07.2020): 3942–60. http://dx.doi.org/10.1007/s10489-020-01713-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

He, Xinggang, i Haixiong Li. "On the abc-problem in Weyl-Heisenberg frames". Czechoslovak Mathematical Journal 64, nr 2 (czerwiec 2014): 447–58. http://dx.doi.org/10.1007/s10587-014-0111-z.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sharma, Harish, Jagdish Chand Bansal, K. V. Arya i Kusum Deep. "Dynamic Swarm Artificial Bee Colony Algorithm". International Journal of Applied Evolutionary Computation 3, nr 4 (październik 2012): 19–33. http://dx.doi.org/10.4018/jaec.2012100102.

Pełny tekst źródła

Streszczenie:

Artificial Bee Colony (ABC) optimization algorithm is relatively a simple and recent population based probabilistic approach for global optimization. ABC has been outperformed over some Nature Inspired Algorithms (NIAs) when tested over test problems as well as real world optimization problems. This paper presents an attempt to modify ABC to make it less susceptible to stick at local optima and computationally efficient. In the case of local convergence, addition of some external potential solutions may help the swarm to get out of the local valley and if the algorithm is taking too much time to converge then deletion of some swarm members may help to speed up the convergence. Therefore, in this paper a dynamic swarm size strategy in ABC is proposed. The proposed strategy is named as Dynamic Swarm Artificial Bee Colony algorithm (DSABC). To show the performance of DSABC, it is tested over 16 global optimization problems of different complexities and a popular real world optimization problem namely Lennard-Jones potential energy minimization problem. The simulation results show that the proposed strategies outperformed than the basic ABC and three recent variants of ABC, namely, the Gbest-Guided ABC, Best-So-Far ABC and Modified ABC.

Style APA, Harvard, Vancouver, ISO itp.

Alaidi, A. H., S. D. Chen i Υ. Weng Leong. "Artificial Bee Colony with Crossover Operations for Discrete Problems". Engineering, Technology & Applied Science Research 12, nr 6 (15.12.2022): 9510–14. http://dx.doi.org/10.48084/etasr.5250.

Pełny tekst źródła

Streszczenie:

The Artificial Bee Colony (ABC) is an algorithm designed to solve continuous problems. ABC has been proven to be more effective than other biological-inspired algorithms. However, it is needed to modify its functionality in order to solve a discrete problem. In this work, a natural modification to the original ABC is made to make it able to solve discrete problems. Six neighborhood operators are proposed to simulate the original behavior of ABC. Moreover, several Traveling Salesman Problem Library (TSPLIB) problems were used to examine the proposed method. The results of the proposed method are promising.

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "ABC-Problem"

Kaur, Gurjeet <1988&gt. "PSO and ABC: comparisons for two-sided risk measures in portfolio selection problem". Master's Degree Thesis, Università Ca' Foscari Venezia, 2016. http://hdl.handle.net/10579/8185.

Pełny tekst źródła

Streszczenie:

One of the most studied problems in finance is the portfolio selection problem. In the classical porfolio selection model, proposed by Markowitz, the risk is measured by the variance of returns. This is good only in few cases, otherwise this will lead to an innacurate investment decision. In order to overcome this issue many alternative measures of risk have been proposed. In this work we will focus on a class of measures that take into account both, positive and negative deviations from the expected returns. We consider a realistic portfolio selection model, that considers several constraints used in the investment practice. This problem is considered to be NP-Hard. To approximatly solve this problem two population-based metaheuristic approaches have been proposed, Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC), and their performances are compared.

Style APA, Harvard, Vancouver, ISO itp.

Kavaliauskas, Donatas. "Dirbtinės bičių kolonijos algoritmai ir jų taikymai maršrutų optimizavimo uždaviniams spręsti". Bachelor's thesis, Lithuanian Academic Libraries Network (LABT), 2013. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130729_153102-94516.

Pełny tekst źródła

Streszczenie:

Šiame darbe yra trumpai apžvelgiami dalelių spiečių sistemų algoritmai, maršrutų optimizavimo uždaviniai ir jų formuluotės, bei praktinės interpretacijos. Plačiau apžvelgiami dirbtinių bičių kolonijų algoritmai ir jų pritaikymas keliaujančio pirklio uždaviniams spręsti. Taip pat šiame darbe galima rasti dirbtinių bičių kolonijų algoritmo pritaikymą keliaujančio pirklio uždaviniams spręsti, bei sukurtos programos skaičiavimo rezultatų analizę.
This paper consists of short description of swarm systems algorithms, route optimisation problems overview and longer description of artificial bee colony algorithms adaptation for traveling salesman problem. Moreover, you can find an artificial bee colony algorithm's application to traveling salesman problem and analysis of computational results.

Style APA, Harvard, Vancouver, ISO itp.

Federici, Danilo. "Ottimizzazione del sistema di picking nel reparto confezionamento e imballaggio nel settore del fresco: il caso Ambruosi e Viscardi". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019.

Znajdź pełny tekst źródła

Streszczenie:

Il focus principale dello scritto riguarda l’ottimizzazione del magazzino nel reparto confezionamento e imballaggio dell’azienda agricola Ambruosi & Viscardi. La tesi è composta da una serie di capitoli, per ognuno dei quali si rivolge l’attenzione ad uno degli argomenti d’analisi di cui l’elaborato si compone. Nel dettaglio: • Il primo capitolo definisce in termini generali cos’è la catena del valore della Supply Chain, per poi passare ad una trattazione più dettagliata della logistica e del Product Allocation Problem; l’analisi prosegue con la distinzione di più sistemi di stoccaggio a seconda delle caratteristiche della merce e delle modalità con cui si intende immagazzinarla, presentando per ciascuna soluzione i vantaggi e gli svantaggi. • Il secondo capitolo approfondisce la realtà su cui sono stati applicati i metodi e le tecniche per la gestione e il ri-allocamento dei codici all’interno del magazzino. Dopo aver presentato l’azienda si ha una descrizione dettagliata di tutto il ciclo produttivo e le peculiarità delle scelte produttive ed organizzative. • Il terzo capitolo, cuore di questo lavoro di tesi, presenta il nuovo modello di allocazione dei prodotti all’interno del magazzino tramite l’uso del modello ABC e quindi il teorema di Pareto. Ogni fase del modello verrà descritta in maniera approfondita, per poi essere presentato il risultato ottenuto. • Nel capitolo quarto verranno infine analizzati i miglioramenti apportati con la nuova allocazione dei codici. Saranno quindi presentati i nuovi KPI dati dall’ottimizzazione apportata.

Style APA, Harvard, Vancouver, ISO itp.

Falta, Michael. "Statistical and computational methods to assess uncertainty and risk in accounting". Thesis, Queensland University of Technology, 2005. https://eprints.qut.edu.au/16053/1/Michael_Falta_Thesis.pdf.

Pełny tekst źródła

Streszczenie:

Informed economic decisions are made on the basis of accounting data. It is therefore crucial to have rigorous and scientific approaches for measuring, modelling and forecasting accounting numbers. Dr Falta's research was motivated by two observations. Firstly, in accounting practice, decision-making often relies on subjective quantifications and forecasts of business activities and, thus, does not account for uncertainty in a rational way. Secondly, there are some academic foundations for statistical approaches to accounting, yet none has been developed carefully enough for results to penetrate and to contribute to practitioners' needs. Dr Falta applied components of mathematics, statistics, econometrics, finance and computing to aspects of accounting and auditing. He developed an enhanced framework for scientific measurement of business process costing and recording accounting transaction data. This has enabled a better understanding of risk in accounting-based decision-making. His research is being incorporated in projects with the Royal Australian Navy and SunWater.

Style APA, Harvard, Vancouver, ISO itp.

Falta, Michael. "Statistical and Computational Methods to Assess Uncertainty and Risk in Accounting". Queensland University of Technology, 2005. http://eprints.qut.edu.au/16053/.

Pełny tekst źródła

Streszczenie:

Style APA, Harvard, Vancouver, ISO itp.

Bénéteau, Laurine. "Médians de graphes : algorithmes, connexité et axiomatique". Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0512.

Pełny tekst źródła

Streszczenie:

Le problème du médian est un des problèmes les plus étudiés en théorie des espaces métriques. Nous l'étudions dans les graphes médians d'un point de vue algorithmique. Nous présentons un algorithme linéaire basé sur un calcul rapide des classes de parallélisme des arêtes (les Thêta-classes) via un parcours en largeur particulier (LexBFS). Nous donnons également un algorithme linéaire pour le problème du médian dans les l1-complexes cubiques des graphes médians et dans les structures d'évènements.Ensuite, nous présentons une caractérisation des graphes aux médians connexes dans la p-ième puissance Gp du graphe et donnons une méthode polynomiale pour vérifier si un graphe est un graphe aux médians Gp-connexes, étendant un résultat de Bandelt et Chepoi (cas p=1). Nous utilisons cette caractérisation pour montrer que certaines classes de graphes sont G2-connexes, comme les graphes de Helly bipartis et les graphes pontés. Nous travaillons également sur l'aspect axiomatique en étudiant l'ABC-problème, qui consiste à déterminer les graphes (nommés ABC-graphes) dans lesquels la fonction médian est l'unique fonction consensus respectant trois axiomes simples (A) Anonymat, (B) Intervalle (Betweeness) et (C) Cohérence. Nous montrons que les graphes modulaires aux médians G2-connexes sont des ABC-graphes et définissons de nouveaux axiomes pour caractériser la fonction médian dans d'autres classes de graphes, comme les graphes aux médians connexes. Nous prouvons également que les graphes respectant la propriété d'appariement (qui sont des ABC-graphes) est une sous-classe propre des graphes de Helly bipartis et étudions la complexité de la reconnaissance de ces graphes
The median problem is one of the most investigated problem in metric graph theory. We will start by studying this problem in median graphs. We present a linear time algorithm based on the majority rule which characterize the median in median graphs and on a fast computation of the parallelism classes of the edges (the \Theta-classes) via LexBFS which is a particular breadth first search algorithm.We also provide linear time algorithms to compute the median set in the l_1-cube complexes of median graphs and in event structures. Then, we provide a characterization of the graphs with connected medians in the pth power of the graph and provide a polynomial method to check if a graph is a G^p-connected median graph, extending a result of Bandelt and Chepoi (case p=1). We use this characterization to prove that some important graph classes in metric graph theory have G2-connected medians, such as bipartite Helly graphs and bridged graphs. We will also studied the axiomatic aspect of the median function by investigating the ABC-problem, which determine the graphs (named ABC-graphs) in which the median function is the only consensus function verifying three simples axioms (A) Anonymat, (B) Betweeness and (C) Consistency. We show that modular graphs with G2-connected medians are ABC-graphs and define new axioms allowing us to characterize the median function on some graph classes. For example the graphs with connected medians (including Helly graphs). We also show that a known class of ABC-graphs (graphs satisfying the pairing property) is a proper subclass of bipartite Helly graphs and we investigate their recognition

Style APA, Harvard, Vancouver, ISO itp.

Pasten, Hector. "Arithmetic problems around the ABC conjecture and connections with logic". Thesis, 2014. http://hdl.handle.net/1974/12123.

Pełny tekst źródła

Streszczenie:

The main theme in this thesis is the ABC conjecture. We prove some partial results towards it and we find new applications of this conjecture, mainly in the context of B\"uchi's n squares problem (which has consequences in logic related to Hilbert's tenth problem) and squarefree values of polynomials. We also study related topics, such as arithmetic properties of additive subgroups of Hecke algebras, function field and meromorphic value distribution, and undecidability of the positive existential theories over languages of arithmetic interest.
Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2014-04-28 10:47:54.064

Style APA, Harvard, Vancouver, ISO itp.

"The problem and opportunity with ABC in a manufacturing concern in Hong Kong". Chinese University of Hong Kong, 1994. http://library.cuhk.edu.hk/record=b5888048.

Pełny tekst źródła

Streszczenie:

by Tang Wai Yin, Kerry.
Thesis (M.B.A.)--Chinese University of Hong Kong, 1994.
Includes bibliographical references (leaves 53-55).
abstract --- p.ii
TABLE OF CONTENTS --- p.iii
CHAPTER
Chapter I --- introduction --- p.1
Purpose --- p.1
Scope --- p.3
Methodology --- p.4
Revision of Original Plan --- p.5
Chapter II --- LITERATURE REVIEW --- p.7
Introduction --- p.7
Brief History of ABC --- p.8
Definition of ABC --- p.19
abc Model --- p.20
Chapter III --- ASIAN PACIFIC FORUM --- p.23
Western Environment: --- p.23
Asian Pacific Environment --- p.26
Organization Behavioral Contrast --- p.28
Chapter IV --- CASE STUDY --- p.33
The Company --- p.33
Management Strategy --- p.35
Product Costing --- p.35
Pricing --- p.37
Implementation : The Struggle --- p.38
The Customer --- p.38
Opportunities and Threats --- p.39
The Human Factor --- p.41
The Stalemate --- p.43
The What-if Scenario --- p.44
Chapter V --- LIMITATIONS AND CONCLUSIONS --- p.46
Limitation --- p.46
Conclusion --- p.48
APPENDIX
Chapter I --- Product Cost Comparison
Traditional and ABC Approach --- p.50
Chapter II --- Process Re-engineering Through ABC --- p.52
BIBLIOGRAPHY --- p.53

Style APA, Harvard, Vancouver, ISO itp.

Rundle, Robert John. "Generalization of Ruderman's Problem to Imaginary Quadratic Fields". Thesis, 2012. http://hdl.handle.net/1974/7062.

Pełny tekst źródła

Streszczenie:

In 1974, H. Ruderman posed the following question: If $(2^m-2^n)|(3^m-3^n)$, then does it follow that $(2^m-2^n)|(x^m-x^n)$ for every integer $x$? This problem is still open. However, in 2011, M. R. Murty and V. K. Murty showed that there are only finitely many $(m,n)$ for which the hypothesis holds. In this thesis, we examine two generalizations of this problem. The first is replacing 2 and 3 with arbitrary integers $a$ and $b$. The second is to replace 2 and 3 with arbitrary algebraic integers from an imaginary quadratic field. In both of these cases we have shown that there are only finitely many $(m,n)$ for which the hypothesis holds. To get the second result we also generalized a result by Bugeaud, Corvaja and Zannier from the integers to imaginary quadratic fields. In the last half of the thesis we use the abc conjecture and some related conjectures to study some exponential Diophantine equations. We study the Pillai conjecture and the Erd\"{o}s-Woods conjecture and show that they are implied by the abc conjecture and that when we use an effective version, very clean bounds for the conjectures are implied.
Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2012-04-13 12:04:14.252

Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "ABC-Problem"

Dai, Xin-Rong, i Qiyu Sun. Abc-Problem for Gabor Systems. American Mathematical Society, 2016.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

R. T. E. Activity Books. Alphabet Maze Book for Kids: ABC Maze Puzzles for Kids 4-8 Activity Workbook for Games, Puzzles, and Problem-Solving , Birthday Gift. Independently Published, 2020.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Mazes Runner: For Kids Ages 3 to 5, Preschool to Kindergarten, Learn ABC, Maze Puzzles, Attention to Detail, Problem-Solving, and More. Independently Published, 2020.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Mazes Runner: For Kids Ages 3 to 5, Preschool to Kindergarten, Learn ABC, Maze Puzzles, Attention to Detail, Problem-Solving, and More. Independently Published, 2020.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Mazes Runner: For Kids Ages 3 to 5, Preschool to Kindergarten, Learn ABC, Maze Puzzles, Attention to Detail, Problem-Solving, and More. Independently Published, 2020.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Puzzle, Papazola. Mazes Runner: For Kids Ages 3 to 5, Preschool to Kindergarten, Learn ABC, Maze Puzzles, Attention to Detail, Problem-Solving, and More. Independently Published, 2020.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

kahnooji, Hossein. Mazes Book for Kids ABC Letter Mazes Age 4-9 Mazes Activity Workbook: Amazing Mazes for Your Kids to Learn Fast Great for Developing Problem Solving Skills. Independently Published, 2020.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Alder, Catherine A., Mary Guerriero Austrom, Michael A. LaMantia i Malaz A. Boustani. Aging Brain Care. Redaktorzy Robert E. Feinstein, Joseph V. Connelly i Marilyn S. Feinstein. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780190276201.003.0008.

Pełny tekst źródła

Streszczenie:

While fragmented care is a problem across the entire health care delivery system, it is especially problematic for vulnerable older adults with dementia and late-life depression. Most older adults have multiple chronic conditions. Cognitive impairment and mood disorders complicate the management of these comorbid conditions by interfering with the patient’s ability to monitor and report symptoms and comply with the care plan. To reduce fragmentation and promote integrated care, each medical provider must adopt a more holistic view of health care, recognizing the importance of communication and collaboration among all providers and the potential impact of any one action on the patient’s overall health. The Aging Brain Care (ABC) model provides a structure for integrating evidence-based interventions for dementia and depression into the primary care environment. By extending the delivery of care beyond the clinic, ABC offers patient-centered services aimed at coordinating care across multiple providers, settings, and community resources.

Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "ABC-Problem"

Rincón-García, Eric-Alfredo, Miguel-Ángel Gutiérrez-Andrade, Sergio-Gerardo de-los-Cobos-Silva, Pedro Lara-Velázquez, Roman-Anselmo Mora-Gutiérrez i Antonin Ponsich. "ABC, A Viable Algorithm for the Political Districting Problem". W Advances in Intelligent Systems and Computing, 269–78. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19704-3_22.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Crawford, Broderick, Ricardo Soto, Franklin Johnson, Melissa Vargas, Sanjay Misra i Fernando Paredes. "A Scheduling Problem for Software Project Solved with ABC Metaheuristic". W Computational Science and Its Applications -- ICCSA 2015, 628–39. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21410-8_48.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Watanabe, Yusuke, Mayumi Takaya i Akihiro Yamamura. "Fitness Function in ABC Algorithm for Uncapacitated Facility Location Problem". W Information and Communication Technology, 129–38. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24315-3_13.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Yang, Gang, Shaohui Wu, Jieping Xu i Xirong Li. "A Novel Hybrid SCH-ABC Approach for the Frequency Assignment Problem". W Neural Information Processing, 522–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-42042-9_65.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Hetmaniok, Edyta, Damian Słota i Adam Zielonka. "Solution of the Inverse Heat Conduction Problem by Using the ABC Algorithm". W Rough Sets and Current Trends in Computing, 659–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13529-3_70.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Basu, Debabrota, Shantanab Debchoudhury, Kai-Zhou Gao i Ponnuthurai Nagaratnam Suganthan. "A Novel Improved Discrete ABC Algorithm for Manpower Scheduling Problem in Remanufacturing". W Swarm, Evolutionary, and Memetic Computing, 738–49. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03753-0_65.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Chaudhari, Kinjal, i Ankit Thakkar. "Travelling Salesman Problem: An Empirical Comparison Between ACO, PSO, ABC, FA and GA". W Emerging Research in Computing, Information, Communication and Applications, 397–405. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6001-5_32.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dai, Xin-Rong, i Qiyu Sun. "The abc-Problem for Gabor Systems and Uniform Sampling in Shift-Invariant Spaces". W Excursions in Harmonic Analysis, Volume 3, 177–94. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-13230-3_8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Hetmaniok, Edyta, Damian Słota, Adam Zielonka i Roman Wituła. "Comparison of ABC and ACO Algorithms Applied for Solving the Inverse Heat Conduction Problem". W Swarm and Evolutionary Computation, 249–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29353-5_29.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Orloff, Michael A. "Modeling the Problem". W ABC-TRIZ, 41–58. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29436-0_4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "ABC-Problem"

Tomar, Ranjeet Singh, Sonali Singh, Shekhar Verma i Geetam Singh Tomar. "A Novel ABC Optimization Algorithm for Graph Coloring Problem". W 2013 5th International Conference on Computational Intelligence and Communication Networks (CICN). IEEE, 2013. http://dx.doi.org/10.1109/cicn.2013.61.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Nagaya, Ryo, i Atsushi Inoie. "Hybrid ABC algorithm for the capacitated vehicle routing problem". W 8th International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS). ACM, 2015. http://dx.doi.org/10.4108/icst.bict.2014.257837.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Aslan, Selcuk, i Sercan Demirci. "Solving UAV Localization Problem with Artificial Bee Colony (ABC) Algorithm". W 2019 4th International Conference on Computer Science and Engineering (UBMK). IEEE, 2019. http://dx.doi.org/10.1109/ubmk.2019.8907034.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Pathak, Neha, Manuj Mishra i Shiv Pratap Singh Kushwah. "Improved local search based modified ABC algorithm for TSP problem". W 2017 4th International Conference on Electronics and Communication Systems (ICECS). IEEE, 2017. http://dx.doi.org/10.1109/ecs.2017.8067863.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Mkaouar, Arij, Skander Htiouech i Habib Chabchoub. "Solving the Multiple choice Multidimensional Knapsack problem with ABC algorithm". W 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2020. http://dx.doi.org/10.1109/cec48606.2020.9185872.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Ghasemi, Elham, Parham Moradi i Mohammad Fathi. "Integrating ABC with genetic grouping for university course timetabling problem". W 2015 5th International Conference on Computer and Knowledge Engineering (ICCKE). IEEE, 2015. http://dx.doi.org/10.1109/iccke.2015.7365857.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Banharnsakun, A., T. Achalakul i B. Sirinaovakul. "ABC-GSX: A hybrid method for solving the Traveling Salesman Problem". W 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC 2010). IEEE, 2010. http://dx.doi.org/10.1109/nabic.2010.5716308.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sharma, Poorti, i Manish Gupta. "TSP Problem Using Modified ABC Based on Dynamically Division of Bees". W 2015 International Conference on Computing Communication Control and automation(ICCUBEA). IEEE, 2015. http://dx.doi.org/10.1109/iccubea.2015.89.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Gong, Weiwei, i Zetian Fu. "ABC-ACO for Perishable Food Vehicle Routing Problem with Time Windows". W 2010 International Conference on Computational and Information Sciences (ICCIS). IEEE, 2010. http://dx.doi.org/10.1109/iccis.2010.311.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dewantara, Almer. "Performance and Problem Analysis in Credit Card Delivery of PT ABC". W Proceedings of the 5th International Conference on Economics, Business and Economic Education Science, ICE-BEES 2022, 9-10 August 2022, Semarang, Indonesia. EAI, 2023. http://dx.doi.org/10.4108/eai.9-8-2022.2338587.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "ABC-Problem"

Gunay, Selim, Fan Hu, Khalid Mosalam, Arpit Nema, Jose Restrepo, Adam Zsarnoczay i Jack Baker. Blind Prediction of Shaking Table Tests of a New Bridge Bent Design. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, listopad 2020. http://dx.doi.org/10.55461/svks9397.

Pełny tekst źródła

Streszczenie:

Considering the importance of the transportation network and bridge structures, the associated seismic design philosophy is shifting from the basic collapse prevention objective to maintaining functionality on the community scale in the aftermath of moderate to strong earthquakes (i.e., resiliency). In addition to performance, the associated construction philosophy is also being modernized, with the utilization of accelerated bridge construction (ABC) techniques to reduce impacts of construction work on traffic, society, economy, and on-site safety during construction. Recent years have seen several developments towards the design of low-damage bridges and ABC. According to the results of conducted tests, these systems have significant potential to achieve the intended community resiliency objectives. Taking advantage of such potential in the standard design and analysis processes requires proper modeling that adequately characterizes the behavior and response of these bridge systems. To evaluate the current practices and abilities of the structural engineering community to model this type of resiliency-oriented bridges, the Pacific Earthquake Engineering Research Center (PEER) organized a blind prediction contest of a two-column bridge bent consisting of columns with enhanced response characteristics achieved by a well-balanced contribution of self-centering, rocking, and energy dissipation. The parameters of this blind prediction competition are described in this report, and the predictions submitted by different teams are analyzed. In general, forces are predicted better than displacements. The post-tension bar forces and residual displacements are predicted with the best and least accuracy, respectively. Some of the predicted quantities are observed to have coefficient of variation (COV) values larger than 50%; however, in general, the scatter in the predictions amongst different teams is not significantly large. Applied ground motions (GM) in shaking table tests consisted of a series of naturally recorded earthquake acceleration signals, where GM1 is found to be the largest contributor to the displacement error for most of the teams, and GM7 is the largest contributor to the force (hence, the acceleration) error. The large contribution of GM1 to the displacement error is due to the elastic response in GM1 and the errors stemming from the incorrect estimation of the period and damping ratio. The contribution of GM7 to the force error is due to the errors in the estimation of the base-shear capacity. Several teams were able to predict forces and accelerations with only moderate bias. Displacements, however, were systematically underestimated by almost every team. This suggests that there is a general problem either in the assumptions made or the models used to simulate the response of this type of bridge bent with enhanced response characteristics. Predictions of the best-performing teams were consistently and substantially better than average in all response quantities. The engineering community would benefit from learning details of the approach of the best teams and the factors that caused the models of other teams to fail to produce similarly good results. Blind prediction contests provide: (1) very useful information regarding areas where current numerical models might be improved; and (2) quantitative data regarding the uncertainty of analytical models for use in performance-based earthquake engineering evaluations. Such blind prediction contests should be encouraged for other experimental research activities and are planned to be conducted annually by PEER.

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!