Suchergebnisse - "branching algorithms"
-
1
Autoren:
Quelle: Journal of Automated Reasoning. 15:359-383
Schlagwörter: 150399 Business and Management not elsewhere classified, FOS: Economics and business, branching algorithms, satisfiability, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Jeroslow-Wang rule, 02 engineering and technology, Theorem proving (deduction, resolution, etc.)
Dateibeschreibung: application/xml
-
2
Autoren:
Weitere Verfasser:
Schlagwörter: Méthode de Monte Carlo, Photobioréacteur, Énergie solaire, Multi-échelles, Formulation en intégrales de chemins, Algorithmes branchés, Monte Carlo method, Photobioreactor, Solar energy, Multi-scale, Path integral formulation, Branching algorithms
Verfügbarkeit: http://www.theses.fr/2021UCFAC014/document
-
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://theses.hal.science/tel-03600307 ; Génie des procédés. Université Clermont Auvergne, 2021. Français. ⟨NNT : 2021UCFAC014⟩.
Schlagwörter: Monte Carlo method, Photobioreactor, Solar energy, Multi-scale, Path integral formulation, Branching algorithms, Méthode de Monte Carlo, Photobioréacteur, Énergie solaire, Multi-échelles, Formulation en intégrales de chemins, Algorithmes branchés, [SPI.GPROC]Engineering Sciences [physics]/Chemical and Process Engineering
Relation: NNT: 2021UCFAC014
-
4
Autoren:
Weitere Verfasser:
Schlagwörter: Monte Carlo method, Branching algorithms, Solar energy, [SPI.GPROC] Engineering Sciences [physics]/Chemical and Process Engineering, Path integral formulation, Formulation en intégrales de chemins, Photobioreactor, Algorithmes branchés, Multi-échelles, Méthode de Monte Carlo, Énergie solaire, Multi-scale, Photobioréacteur
Dateibeschreibung: application/pdf
Zugangs-URL: https://theses.hal.science/tel-03600307v1
-
5
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Filtering, Particle Systems, Branching Algorithms, Interacting Algorithms, Measure Valued Processes, Numerical Solutions
Dateibeschreibung: application/postscript
-
6
Parametrizované algoritmy pro podchycování podgrafů ; Parameterized Algorithms for Hitting Subgraphs
Autoren:
Weitere Verfasser:
Schlagwörter: grafové algoritmy, parametrizovaná složitost, parametrizované algoritmy, kernelizace, algoritmy založené na větvení, iterativní komprese, Expansion Lemma, automatizovaný návrh algoritmů, problémy mazání vrcholů, d-Hitting Set, F-Subgraph Vertex Deletion, d-Path Vertex Cover, graph algorithms, parameterized complexity, parameterized algorithms, kernelization, branching algorithms, iterative compression, automated algorithm design, vertex deletion problems
Dateibeschreibung: application/pdf
Relation: http://hdl.handle.net/10467/118283
Verfügbarkeit: http://hdl.handle.net/10467/118283
-
7
Autoren:
Weitere Verfasser:
Schlagwörter: Équilibrage de charge, Couverture de sommet, Algorithmes parallèles, Parallélisme évolutif, Algorithmes de branchement, Load balancing, Vertex cover, Parallel algorithms, Scalable parallelism, Branching algorithms
Relation: http://hdl.handle.net/11143/18687
Verfügbarkeit: http://hdl.handle.net/11143/18687
-
8
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: phylogenetics, theoretical computer science, algorithms, graph theory, agreement forests, combinatorics, cluster reduction, lateral gene transfer, branching algorithms, fixed-parameter tractability
Dateibeschreibung: application/pdf
Relation: https://hdl.handle.net/10222/80798
Verfügbarkeit: https://hdl.handle.net/10222/80798
-
9
Autoren:
Schlagwörter: Discrete-time control/observation systems, discrete-time filtering, nonlinear filtering, branching algorithms, measure valued processes, Stochastic particle methods, interacting algorithms, Nonlinear systems in control theory, numerical solutions, particle systems, Filtering in stochastic control theory, Random measures
Dateibeschreibung: application/xml
Zugangs-URL: https://zbmath.org/1358322
Full Text Finder
Nájsť tento článok vo Web of Science