Results 61 to 70 of about 130,220 (362)
Space Saving by Dynamic Algebraization
Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the treewidth.
A. Björklund +16 more
core +1 more source
Stabilization of L‐PBF Ni50.7Ti49.3 under low‐cycle loading was investigated. Recoverable strain after cycling was dependent on the amount of applied load. Recovery ratio was 53.4% and 35.1% at intermediate and high load, respectively. The maximum total strain reached 10.3% at a high load of 1200 MPa.
Ondřej Červinek +5 more
wiley +1 more source
On Separating Path and Tree Systems in Graphs [PDF]
We explore the concept of separating systems of vertex sets of graphs. A separating system of a set $X$ is a collection of subsets of $X$ such that for any pair of distinct elements in $X$, there exists a set in the separating system that contains ...
Ahmad Biniaz +8 more
doaj +1 more source
Hamiltonian Paths Through Two- and Three-Dimensional Grids
This paper addresses the existence of Hamiltonian paths and cycles in two-dimensional grids consisting of triangles or quadrilaterals, and three-dimensional grids consisting of tetrahedra or hexahedra. The paths and cycles may be constrained to pass from
W. Mitchell
semanticscholar +1 more source
Two-Oracle Optimal Path Planning on Grid Maps
Path planning on grid maps has progressed significantly in recent years, partly due to the Grid-based Path Planning Competition GPPC. In this work we present an optimal approach which combines features from two modern path planning systems, SRC and JPS+, both of which were among the strongest entrants at the 2014 edition of the ...
SALVETTI, MATTEO +4 more
openaire +2 more sources
Additive Gaussian Process Regression for Predictive Design of High‐Performance, Printable Silicones
A chemistry‐aware design framework for tuning printable polydimethylsiloxane (PDMS) for vat photopolymerization (VPP) is developed using additive Gaussian process (GP) modeling. Polymer network mechanics informs variable groupings, feasible formulation constraints, and interaction variables.
Roxana Carbonell +3 more
wiley +1 more source
Breaking Path Symmetries on 4-Connected Grid Maps
Pathfinding systems that operate on regular grids are common in the AI literature and often used in real-time video games. Typical speed-up enhancements include reducing the size of the search space using abstraction, and building more informed heuristics. Though effective each of these strategies has shortcomings.
Daniel Harabor, Adi Botea
openaire +1 more source
Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography
We study maximal identifiability, a measure recently introduced in Boolean Network Tomography to characterize networks' capability to localize failure nodes in end-to-end path measurements.
Galesi, Nicola, Ranjbar, Fariba
core +1 more source
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
Low‐consumable nickel ferrite‐based anodes for the Hall–Héroult process are compared with conventional prebaked carbon anodes using thermodynamic simulation and prospective life cycle assessment under contrasting future electricity system pathways from 2025 to 2050.
Felipe Alejandro Garcia Paz +6 more
wiley +1 more source

