Academic literature on the topic 'Algorithme split'

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

Select a source type:

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

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

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

Journal articles on the topic "Algorithme split"

1

Ortiz Díaz, Agustín Alejandro, Isvani Inocencio Frías Blanco, Laura María Palomino Mariño, and Fabiano Baldo. "An Online Tree-Based Approach for Mining Non-Stationary High-Speed Data Streams." Revista de Informática Teórica e Aplicada 27, no. 1 (2020): 36–47. http://dx.doi.org/10.22456/2175-2745.90822.

Full text
Abstract:
This paper presents a new learning algorithm for inducing decision trees from data streams. In these domains, large amounts of data are constantly arriving over time, possibly at high speed. The proposed algorithm uses a top-down induction method for building trees, splitting leaf nodes recursively, until none of them can be expanded. The new algorithm combines two split methods in the tree induction. The first method is able to guarantee, with statistical significance, that each split chosen would be the same as that chosen using infinite examples. By doing so, it aims at ensuring that the tr
APA, Harvard, Vancouver, ISO, and other styles
2

García-Martín, Eva, Niklas Lavesson, Håkan Grahn, Emiliano Casalicchio, and Veselka Boeva. "Energy-aware very fast decision tree." International Journal of Data Science and Analytics 11, no. 2 (2021): 105–26. http://dx.doi.org/10.1007/s41060-021-00246-4.

Full text
Abstract:
AbstractRecently machine learning researchers are designing algorithms that can run in embedded and mobile devices, which introduces additional constraints compared to traditional algorithm design approaches. One of these constraints is energy consumption, which directly translates to battery capacity for these devices. Streaming algorithms, such as the Very Fast Decision Tree (VFDT), are designed to run in such devices due to their high velocity and low memory requirements. However, they have not been designed with an energy efficiency focus. This paper addresses this challenge by presenting
APA, Harvard, Vancouver, ISO, and other styles
3

Liang, Liang. "A Fusion Multiobjective Empire Split Algorithm." Journal of Control Science and Engineering 2020 (December 14, 2020): 1–14. http://dx.doi.org/10.1155/2020/8882086.

Full text
Abstract:
In the last two decades, swarm intelligence optimization algorithms have been widely studied and applied to multiobjective optimization problems. In multiobjective optimization, reproduction operations and the balance of convergence and diversity are two crucial issues. Imperialist competitive algorithm (ICA) and sine cosine algorithm (SCA) are two potential algorithms for handling single-objective optimization problems, but the research of them in multiobjective optimization is scarce. In this paper, a fusion multiobjective empire split algorithm (FMOESA) is proposed. First, an initialization
APA, Harvard, Vancouver, ISO, and other styles
4

Jin, C., L. J. Lu, and J. N. Min. "A two-stage construction heuristic approach for vehicle routing problem with split deliveries and pickups: Case studies and performance comparison." Advances in Production Engineering & Management 17, no. 1 (2022): 121–33. http://dx.doi.org/10.14743/apem2022.1.425.

Full text
Abstract:
The vehicle routing problem with split deliveries and pickups is a hot research topic in recent years, where a customer can be served multiple times with split deliveries and pickups. The objective is to minimize the travel distance, use the fewest number of vehicles and increase the load rate, which will further reduce the carbon emissions that damage the environment. In this paper, we use a two-stage construction heuristic approach to solve this problem. First, partitioning algorithms based on the multi-restart-iterative sweep algorithm are adopted to partition the customer domain into sub-d
APA, Harvard, Vancouver, ISO, and other styles
5

Pinker, Rachel T., Donglian Sun, Meng-Pai Hung, Chuan Li, and Jeffrey B. Basara. "Evaluation of Satellite Estimates of Land Surface Temperature from GOES over the United States." Journal of Applied Meteorology and Climatology 48, no. 1 (2009): 167–80. http://dx.doi.org/10.1175/2008jamc1781.1.

Full text
Abstract:
Abstract A comprehensive evaluation of split-window and triple-window algorithms to estimate land surface temperature (LST) from Geostationary Operational Environmental Satellites (GOES) that were previously described by Sun and Pinker is presented. The evaluation of the split-window algorithm is done against ground observations and against independently developed algorithms. The triple-window algorithm is evaluated only for nighttime against ground observations and against the Sun and Pinker split-window (SP-SW) algorithm. The ground observations used are from the Atmospheric Radiation Measur
APA, Harvard, Vancouver, ISO, and other styles
6

Hidayat, Trifenaus Prabu, and Andre Sugioko. "Performance Analyzes of Bee Colony Split-Plot Algorithm." International Journal of Information and Education Technology 5, no. 7 (2015): 549–52. http://dx.doi.org/10.7763/ijiet.2015.v5.566.

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

Yang, Bin-Bin, Song-Qing Shen, and Wei Gao. "Weighted Oblique Decision Trees." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 5621–27. http://dx.doi.org/10.1609/aaai.v33i01.33015621.

Full text
Abstract:
Decision trees have attracted much attention during the past decades. Previous decision trees include axis-parallel and oblique decision trees; both of them try to find the best splits via exhaustive search or heuristic algorithms in each iteration. Oblique decision trees generally simplify tree structure and take better performance, but are always accompanied with higher computation, as well as the initialization with the best axis-parallel splits. This work presents the Weighted Oblique Decision Tree (WODT) based on continuous optimization with random initialization. We consider different we
APA, Harvard, Vancouver, ISO, and other styles
8

Bollwein, Ferdinand, and Stephan Westphal. "A branch & bound algorithm to determine optimal bivariate splits for oblique decision tree induction." Applied Intelligence 51, no. 10 (2021): 7552–72. http://dx.doi.org/10.1007/s10489-021-02281-x.

Full text
Abstract:
AbstractUnivariate decision tree induction methods for multiclass classification problems such as CART, C4.5 and ID3 continue to be very popular in the context of machine learning due to their major benefit of being easy to interpret. However, as these trees only consider a single attribute per node, they often get quite large which lowers their explanatory value. Oblique decision tree building algorithms, which divide the feature space by multidimensional hyperplanes, often produce much smaller trees but the individual splits are hard to interpret. Moreover, the effort of finding optimal obli
APA, Harvard, Vancouver, ISO, and other styles
9

Huang, Zheng, Yanting Zhang, Lin Wang, Jingyu Xu, and Yunlong Zheng. "Research on multi-objective parameter optimization of split flow dual flash thermodynamic cycle." Journal of Physics: Conference Series 2728, no. 1 (2024): 012008. http://dx.doi.org/10.1088/1742-6596/2728/1/012008.

Full text
Abstract:
Abstract In addition to considering the intermediate pressure variables, the split flow double flash thermodynamic cycle also needs to consider the operating conditions and split flow coefficient of the cycle. Traditional algorithms require too much computation and have a longer response time. Faced with sudden operating conditions or changes in production conditions, it is difficult to quickly re-optimize the intermediate parameters of the split flow double flash thermal cycle and carry out corresponding system control. This article uses intelligent optimization algorithms instead of global s
APA, Harvard, Vancouver, ISO, and other styles
10

Xiao, Su. "Deblurring by Solving a TVp-Regularized Optimization Problem Using Split Bregman Method." Advances in Multimedia 2014 (2014): 1–11. http://dx.doi.org/10.1155/2014/906464.

Full text
Abstract:
Image deblurring is formulated as an unconstrained minimization problem, and its penalty function is the sum of the error term and TVp-regularizers with0<p<1. Although TVp-regularizer is a powerful tool that can significantly promote the sparseness of image gradients, it is neither convex nor smooth, thus making the presented optimization problem more difficult to deal with. To solve this minimization problem efficiently, such problem is first reformulated as an equivalent constrained minimization problem by introducing new variables and new constraints. Thereafter, the split Bregman met
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Algorithme split"

1

Rao, Michaël. "Décompositions de graphes et algorithmes efficaces." Metz, 2006. http://docnum.univ-lorraine.fr/public/UPV-M/Theses/2006/Rao.Michael.SMZ0607.pdf.

Full text
Abstract:
Ce mémoire traite de la décomposition modulaire ainsi que différentes de ses généralisations. Dans un premier temps, on explique comment se servir de décompositions pour résoudre efficacement certains problèmes sur les graphes. En particulier, en utilisant la décomposition modulaire, on obtient des algorithmes linéaires pour les problèmes " ensemble stable ", " clique ", " nombre chromatique " et " partition en cliques " sur les graphes sans P_5 et gem induit. On étudie également comment la décomposition en coupes peut servir pour calculer le nombre chromatique, et on exhibe une nouvelle class
APA, Harvard, Vancouver, ISO, and other styles
2

Perdigão, Martino Diego. "Stratégies d'optimisation pour le problème intégré de transport et de gestion de stock." Electronic Thesis or Diss., Université Clermont Auvergne (2021-...), 2024. http://www.theses.fr/2024UCFA0139.

Full text
Abstract:
Les problèmes de gestion de stock et de routage de véhicule sont des défis logistiques qui peuvent influencer de manière significative l'efficacité et l'efficience des opérations de la chaîne logistique et doivent être bien coordonnées et alignées. Les gérer conjointement est encore plus difficile lorsqu'on prend en compte le nombre de clients à servir et la durée de l'horizon de temps. Dans la littérature, ce problème est connu sous le nom de Inventory Routing Problem (IRP) et vise à trouver une solution de coût minimum qui traite les problèmes de stock et de transport simultanément. L'IRP a
APA, Harvard, Vancouver, ISO, and other styles
3

Franciosi, Felipe Mainieri. "Uma abordagem paralela para o algoritmo Split." Pontifícia Universidade Católica do Rio Grande do Sul, 2008. http://hdl.handle.net/10923/1543.

Full text
Abstract:
Made available in DSpace on 2013-08-07T18:42:48Z (GMT). No. of bitstreams: 1 000431851-Texto+Completo-0.pdf: 926379 bytes, checksum: 41dde88f7d4f933186ff71b29831c0c2 (MD5) Previous issue date: 2008<br>The behavioral analysis of a process allows the detection of deficiencies, as well as assessing performance impact caused by environmental changes. The use of analytical models to describe the observed process provides these data through the resolution of equation systems. In the case where modeling is made using formalisms such as Stochastic Automata Network, the resolution of these systems de
APA, Harvard, Vancouver, ISO, and other styles
4

Douchin, Nicolas. "Étude de l'influence du conduit d'évaporation atmosphérique sur des liaisons satellite-navire entre 1 et 10 GHz : contribution à l'élaboration d'une méthode de caractérisation de ce conduit." Toulouse, ENSAE, 1992. http://www.theses.fr/1992ESAE0017.

Full text
Abstract:
Le conduit d'évaporation, presque toujours présent à la surface des océans, peut engendrer une modification sensible de la couverture à site bas des systèmes radioélectriques embarqués sur les navires. C'est pourquoi la connaissance, à tout instant, de ce conduit est essentielle. Or, il n'existe actuellement aucun moyen de mesure directe du profil d'indice de réfraction, utilisable opérationnellement. Nous avons donc étudié la possibilité de caractériser le conduit d'évaporation à partir des effets engendrés par celui-ci sur les liaisons satellite-navire à élévation très faible. Nos travaux on
APA, Harvard, Vancouver, ISO, and other styles
5

Brochier, Felipe Osmar Berwanger. "Otimização de um condicionador de ar do tipo split com vazão variável de refrigerante." Universidade do Vale do Rio dos Sinos, 2014. http://www.repositorio.jesuita.org.br/handle/UNISINOS/4619.

Full text
Abstract:
Submitted by Fabricia Fialho Reginato (fabriciar) on 2015-07-23T01:11:46Z No. of bitstreams: 1 FelipeBrochier.pdf: 2248315 bytes, checksum: 51a12fbb2e530bf08f1847557932b381 (MD5)<br>Made available in DSpace on 2015-07-23T01:11:46Z (GMT). No. of bitstreams: 1 FelipeBrochier.pdf: 2248315 bytes, checksum: 51a12fbb2e530bf08f1847557932b381 (MD5) Previous issue date: 2014-02<br>Nenhuma<br>Este trabalho tem como objetivo otimizar o custo operacional dependente dos parâmetros de vazão de ar do condensador, número de aletas e de circuitos do condensador, frequência do compressor e parâmetros do dispo
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Zhuo. "A split-and-merge approach for quadrilateral-based image segmentation." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B38749440.

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

Shi, Haijian. "Best-first Decision Tree Learning." The University of Waikato, 2007. http://hdl.handle.net/10289/2317.

Full text
Abstract:
In best-first top-down induction of decision trees, the best split is added in each step (e.g. the split that maximally reduces the Gini index). This is in contrast to the standard depth-first traversal of a tree. The resulting tree will be the same, just how it is built is different. The objective of this project is to investigate whether it is possible to determine an appropriate tree size on practical datasets by combining best-first decision tree growth with cross-validation-based selection of the number of expansions that are performed. Pre-pruning, post-pruning, CART-pruning can be perfo
APA, Harvard, Vancouver, ISO, and other styles
8

Cinnella, Pasquale. "Flux-split algorithms for flows with non-equilibrium chemistry and thermodynamics." Diss., Virginia Polytechnic Institute and State University, 1989. http://hdl.handle.net/10919/54506.

Full text
Abstract:
New flux-split algorithms are developed for high velocity, high-temperature flow situations, when finite-rate chemistry and non-equilibrium thermodynamics greatly affect the physics of the problem. Two flux-vector-split algorithms, of the Steger-Warming and of the Van Leer type, and one flux-difference-split algorithm of the Roe type are established and utilized for the accurate numerical simulation of flows with dissociation, ionization, and combustion phenomena. Several thermodynamic models are used, including a simplified vibrational non-equilibrium model and an equilibrium model based upon
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Rongrong. "A Novel Attack Method Against Split Manufactured Circuits." University of Cincinnati / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1573812230926837.

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

Chen, Zhuo, and 陳卓. "A split-and-merge approach for quadrilateral-based image segmentation." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B38749440.

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

Books on the topic "Algorithme split"

1

Anderson, W. Kyle. Three-dimensional multigrid algorithms for the flux-split Euler equations. National Aeronautics and Space Administration, Scientific and Technical Information Division, 1989.

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

1952-, Thomas James L., Whitfield David L, and United States. National Aeronautics and Space Administration. Scientific and Technical Information Division., eds. Three-dimensional multigrid algorithms for the flux-split Euler equations. National Aeronautics and Space Administration, Scientific and Technical Information Division, 1989.

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

Anderson, W. Kyle. Three-dimensional multigrid algorithms for the flux-split Euler equations. National Aeronautics and Space Administration, Scientific and Technical Information Division, 1989.

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

Anderson, W. Kyle. Three-dimensional multigrid algorithms for the flux-split Euler equations. Langley Research Center, 1988.

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

United States. National Aeronautics and Space Administration., ed. Implicit multigrid algorithms for the three-dimensional flux split Euler equations. National Aeronautics and Space Administration, 1986.

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

Institute for Computer Applications in Science and Engineering. and United States. National Aeronautics and Space Administration., eds. Parallel directionally split solver based on reformulation of pipelined Thomas algorithm. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1998.

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

B, Grossman, and United States. National Aeronautics and Space Administration., eds. Calculation of hypersonic shock structure using flux-splut algorithms. Interdiciplinmary Center for Applied Mathematics, Virginia Polytechnic Institute and State University, 1991.

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

United States. National Aeronautics and Space Administration. and Mississippi State University. Dept. of Aerophysics and Aerospace Engineering., eds. Adaptive grid embedding for the two-dimensional flux-split Euler equations. Mississippi State University, Dept. of Aerospace Engineering, 1990.

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

Implicit multigrid algorithms for the three-dimensional flux split Euler equations. National Aeronautics and Space Administration, 1986.

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

Das, Vinu V., and Passent M. El-Kafrawy. Signal Processing and Information Technology: Second International Joint Conference, SPIT 2012, Dubai, UAE, September 20-21, 2012, Revised Selected Papers. Springer, 2014.

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

Book chapters on the topic "Algorithme split"

1

Chalupa, Marek, and Cedric Richter. "Bubaak-SpLit: Split what you cannot verify (Competition contribution)." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57256-2_20.

Full text
Abstract:
AbstractBubaak-SpLit is a tool for dynamically splitting verification tasks into parts that can then be analyzed in parallel. It is built on top of Bubaak, a tool designed for running combinations of verifiers in parallel. In contrast to Bubaak, that directly invokes verifiers on the inputs, Bubaak-SpLit first starts by splitting the input program into multiple modified versions called program splits. During the splitting process, Bubaak-SpLit utilizes a weak verifier (in our case symbolic execution with a short timelimit) to analyze each generated program split. If the weak verifier fails on a program split, we split this program split again and start the verification process again on the generated program splits. We run the splitting process until a predefined number of hard-to-verify program splits is generated or a splitting limit is reached. During the main verification phase, we run a combination of Bubaak-Lee and Slowbeast in parallel on the remaining unsolved parts of the verification task.
APA, Harvard, Vancouver, ISO, and other styles
2

Fomin, Fedor V., and Dieter Kratsch. "Split and List." In Exact Exponential Algorithms. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16533-7_9.

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

Takahashi, Daisuke. "Split-Radix FFT Algorithms." In High-Performance Computing Series. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-9965-7_4.

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

Paul, Christophe. "Split Decomposition via Graph-Labelled Trees." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_686.

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

Paul, Christophe. "Split Decomposition via Graph-Labelled Trees." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_686-1.

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

Zhang, Han, Qing Li, and Xin Yao. "Knowledge-Guided Optimization for Complex Vehicle Routing with 3D Loading Constraints." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-70055-2_9.

Full text
Abstract:
AbstractThe split delivery vehicle routing problem with three-dimensional loading constraints (3L-SDVRP) intertwines complex routing and packing challenges. The current study addresses 3L-SDVRP using intelligent optimization algorithms, which iteratively evolve towards optimal solutions. A pivotal aspect of these algorithms is search operators that determine the search direction and the search step size. Effective operators significantly improve algorithmic performance. Traditional operators like swap, shift, and 2-opt fall short in complex scenarios like 3L-SDVRP, mainly due to their limited capacity to leverage domain knowledge. Additionally, the search step size is crucial: smaller steps enhance fine-grained search (exploitation), while larger steps facilitate exploring new areas (exploration). However, optimally balancing these step sizes remains an unresolved issue in 3L-SDVRP. To address this, we introduce an adaptive knowledge-guided insertion (AKI) operator. This innovative operator uses node distribution characteristics for adaptive node insertion, enhancing search abilities through domain knowledge integration and larger step sizes. Integrating AKI with the local search framework, we develop an adaptive knowledge-guided search (AKS) algorithm, which effectively balances exploitation and exploration by combining traditional neighbourhood operators for detailed searches with the AKI operator for broader exploration. Our experiments demonstrate that the AKS algorithm significantly outperforms the state-of-the-art method in solving various 3L-SDVRP instances.
APA, Harvard, Vancouver, ISO, and other styles
7

Gioan, Emeric, and Christophe Paul. "Dynamic Distance Hereditary Graphs Using Split Decomposition." In Algorithms and Computation. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-77120-3_6.

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

Renjith, P., and N. Sadagopan. "Hamiltonicity in Split Graphs - A Dichotomy." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53007-9_28.

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

Divya, D., and S. Vijayakumar. "On Star Partition of Split Graphs." In Algorithms and Discrete Applied Mathematics. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-52213-0_15.

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

Ounali, Chedi, Fahmi Ben Rejab, and Kaouther Nouira Ferchichi. "Incremental Algorithm Based on Split Technique." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16660-1_55.

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

Conference papers on the topic "Algorithme split"

1

Wang, Yan. "Design and Application of Web-based Education Management System using Split and Kernel based Residual Network." In 2024 International Conference on Intelligent Algorithms for Computational Intelligence Systems (IACIS). IEEE, 2024. http://dx.doi.org/10.1109/iacis61494.2024.10721891.

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

Ghosh, Anjan, and Paparao Palacharla. "Efficient optical preprocessing using split-step algorithms." In OSA Annual Meeting. Optica Publishing Group, 1989. http://dx.doi.org/10.1364/oam.1989.tudd2.

Full text
Abstract:
A new and efficient split-step polynomial preconditioning algorithm is discussed. In this algorithm, basic polynomial preconditioning iterations are repeated several times, each time with an improved matrix. With minor modifications this algorithm can be used for matrix inversion and condition number estimation. The split-step algorithms consist of two nested iterative loops involving matrix multiplications and thus are attractive for parallel optical processors. The details of realization of splitstep algorithms on three different optical matrix multiplier architectures are outlined. The cond
APA, Harvard, Vancouver, ISO, and other styles
3

Sun, Jian, Hongyu Jia, Bo Hu, et al. "Speeding up Very Fast Decision Tree with Low Computational Cost." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/177.

Full text
Abstract:
Very Fast Decision Tree (VFDT) is one of the most widely used online decision tree induction algorithms, and it provides high classification accuracy with theoretical guarantees. In VFDT, the split-attempt operation is essential for leaf-split. It is computation-intensive since it computes the heuristic measure of all attributes of a leaf. To reduce split-attempts, VFDT tries to split at constant intervals (for example, every 200 examples). However, this mechanism introduces split-delay for split can only happen at fixed intervals, which slows down the growth of VFDT and finally lowers accurac
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Zheyu, Tianping Zhang, and Jian Li. "Unbiased Gradient Boosting Decision Tree with Unbiased Feature Importance." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/515.

Full text
Abstract:
Gradient Boosting Decision Tree (GBDT) has achieved remarkable success in a wide variety of applications. The split finding algorithm, which determines the tree construction process, is one of the most crucial components of GBDT. However, the split finding algorithm has long been criticized for its bias towards features with a large number of potential splits. This bias introduces severe interpretability and overfitting issues in GBDT. To this end, we provide a fine-grained analysis of bias in GBDT and demonstrate that the bias originates from 1) the systematic bias in the gain estimation of e
APA, Harvard, Vancouver, ISO, and other styles
5

Bayat, Saeid, Nastaran Shahmansouri, Satya RT Peddada, Alex Tessier, Adrian Butscher, and James T. Allison. "Multi-Split Configuration Design for Fluid-Based Thermal Management Systems." In ASME 2024 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2024. http://dx.doi.org/10.1115/detc2024-143578.

Full text
Abstract:
Abstract High power density systems require efficient cooling to maintain their thermal performance. Despite this, as systems get larger and more complex, human expertise and insight may not suffice to determine the desired thermal management system designs. To this end, a framework for automatic architecture exploration is presented in this article for a class of single-phase, multi-split cooling systems. For this class of systems, heat generation devices are clustered based on their spatial information, and flow splits are added only when required and at the location of heat devices. To gene
APA, Harvard, Vancouver, ISO, and other styles
6

Ling, Hangkun. "Emulating Expert Systems and the Location-Identity Split." In 2018 International Conference on Computer Modeling, Simulation and Algorithm (CMSA 2018). Atlantis Press, 2018. http://dx.doi.org/10.2991/cmsa-18.2018.19.

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

Henriksen, Patrick, and Alessio Lomuscio. "DEEPSPLIT: An Efficient Splitting Method for Neural Network Verification via Indirect Effect Analysis." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/351.

Full text
Abstract:
We propose a novel, complete algorithm for the verification and analysis of feed-forward, ReLU-based neural networks. The algorithm, based on symbolic interval propagation, introduces a new method for determining split-nodes which evaluates the indirect effect that splitting has on the relaxations of successor nodes. We combine this with a new efficient linear-programming encoding of the splitting constraints to further improve the algorithm’s performance. The resulting implementation, DeepSplit, achieved speedups of 1–2 orders of magnitude and 21-34% fewer timeouts when compared to the curren
APA, Harvard, Vancouver, ISO, and other styles
8

Zecevic, Zarko, and Bozo Krstajic. "Low-complexity dynamic synchrophasor estimation algorithm." In 2018 23rd International Scientific-Professional Conference on Information Technology (IT). IEEE, 2018. http://dx.doi.org/10.1109/spit.2018.8350862.

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

Hoyle, Christopher, Wei Chen, Bruce Ankenman, and Nanxin Wang. "Optimal Experimental Design of Human Appraisals for Modeling Consumer Preferences in Engineering Design." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-49561.

Full text
Abstract:
Human appraisals are becoming increasingly important in the design of engineering systems to link engineering design attributes to customer preferences. Human appraisals are used to assess consumers’ opinions of a given product design, and are unique in that the experiment response is a function of both the product attributes and the respondents’ demographic attributes. The design of a human appraisal is characterized as a split-plot design, in which the respondent demographic attributes form the whole-plot factors while the product attributes form the split-plot factors. The experiments are a
APA, Harvard, Vancouver, ISO, and other styles
10

Wu, C. H., and A. E. Yagle. "The gradient adaptive split lattice algorithm." In [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing. IEEE, 1992. http://dx.doi.org/10.1109/icassp.1992.226447.

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

Reports on the topic "Algorithme split"

1

Ostashev, Vladimir, Michael Muhlestein, and D. Wilson. Extra-wide-angle parabolic equations in motionless and moving media. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/42043.

Full text
Abstract:
Wide-angle parabolic equations (WAPEs) play an important role in physics. They are derived by an expansion of a square-root pseudo-differential operator in one-way wave equations, and then solved by finite-difference techniques. In the present paper, a different approach is suggested. The starting point is an extra-wide-angle parabolic equation (EWAPE) valid for small variations of the refractive index of a medium. This equation is written in an integral form, solved by a perturbation technique, and transformed to the spectral domain. The resulting split-step spectral algorithm for the EWAPE a
APA, Harvard, Vancouver, ISO, and other styles
2

Warren, Russell, Stanley Osher, and Richard Vanderbeek. Multiple Aerosol Unmixing by the Split Bregman Algorithm. Defense Technical Information Center, 2011. http://dx.doi.org/10.21236/ada555738.

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

Szymczak, William G. Viscous Split Algorithms for the Time Dependent Incompressible Navier Stokes Equations. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada211592.

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

Barrios, Amalia E., and Kenneth H. Craig. Rough Surface Models Implemented Within the Split-Step Parabolic Equation Algorithm. Defense Technical Information Center, 1994. http://dx.doi.org/10.21236/ada280843.

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

Zhao, George, Grang Mei, Bulent Ayhan, Chiman Kwan, and Venu Varma. DTRS57-04-C-10053 Wave Electromagnetic Acoustic Transducer for ILI of Pipelines. Pipeline Research Council International, Inc. (PRCI), 2005. http://dx.doi.org/10.55274/r0012049.

Full text
Abstract:
In this project, Intelligent Automation, Incorporated (IAI) and Oak Ridge National Lab (ORNL) propose a novel and integrated approach to inspect the mechanical dents and metal loss in pipelines. It combines the state-of-the-art SH wave Electromagnetic Acoustic Transducer (EMAT) technique, through detailed numerical modeling, data collection instrumentation, and advanced signal processing and pattern classifications, to detect and characterize mechanical defects in the underground pipeline transportation infrastructures. The technique has four components: (1) thorough guided wave modal analysis
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!