Results 31 to 40 of about 178,189 (288)
Finding and proving the optimum : cooperative stochastic and deterministic search [PDF]
, 2012 In this article, we introduce a global cooperative approach between an Interval Branch and Bound Algorithm and an Evolutionary Algorithm, that takes advantage of both methods to optimize a function for which an inclusion function can be expressed.
Alliot, Jean-Marc +3 more
core +2 more sources
Advanced Engineering Materials, EarlyView.Four‐point bending tests are conducted in an argon atmosphere on commercial MgO‐C brick grades with and without MgO‐C recyclate from room temperature up to 1300 °C. No detrimental effect of the MgO‐C recyclates on bending strength is found. Instead, a decisive influence of the total carbon content is observed, with lower total carbon contents ...
Alexander Schramm +5 more
wiley +1 more source
IEEE Access, 2019 In this paper, we present some initial results of several meta-heuristic optimization algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic programming, greedy search algorithm, and a hybrid genetic algorithm-simulated ...
Absalom E. Ezugwu +4 more
doaj +1 more source
Computational Protein Design Using AND/OR Branch-and-Bound Search
, 2015 The computation of the global minimum energy conformation (GMEC) is an important and challenging topic in structure-based computational protein design.
Wu, Yuexin, Zeng, Jianyang, Zhou, Yichao
core +1 more source
Advanced Engineering Materials, EarlyView.Copper‐based composites enhanced with carbon feature convenient mechanical properties and favorable electric conductivity. Processing via deformation and thermomechanical treatments can introduce advantageous microstructures further enhancing their performance. Herein, copper–graphene powder‐based composites are directly consolidated via rotary swaging
Radim Kocich +3 more
wiley +1 more source
Tree-Independent Dual-Tree Algorithms [PDF]
, 2013 Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often complex and burdensome.
Anderson, David V. +5 more
core
Branch and bound algorithms for maximizing expected improvement functions [PDF]
Journal of Statistical Planning and Inference, 2011 Deterministic computer simulations are often used as a replacement for complex physical experiments. Although less expensive than physical experimentation, computer codes can still be time-consuming to run. An effective strategy for exploring the response surface of the deterministic simulator is the use of an approximation to the computer code, such ...
Franey, Mark +2 more
openaire +3 more sources
Advanced Functional Materials, EarlyView.Bio‐based and (semi‐)synthetic zwitterion‐modified novel materials and fully synthetic next‐generation alternatives show the importance of material design for different biomedical applications. The zwitterionic character affects the physiochemical behavior of the material and deepens the understanding of chemical interaction mechanisms within the ...
Theresa M. Lutz +3 more
wiley +1 more source
Greedy Graph Colouring is a Misleading Heuristic [PDF]
, 2013 State of the art maximum clique algorithms use a greedy graph colouring as a bound. We show that greedy graph colouring can be misleading, which has implications for parallel branch and ...
McCreesh, Ciaran, Prosser, Patrick
core
Branch and bound algorithms for the bus evacuation problem [PDF]
Computers & Operations Research, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goerigk, Marc +2 more
openaire +4 more sources