Results 111 to 120 of about 14,692 (300)
Learning polyhedral classifiers using logistic function
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimization problem, our method solves an unconstrained optimization problem.
Sastry, PS, Manwani, Naresh
core
Polyhedral Analysis using Parametric Objectives [PDF]
The abstract domain of polyhedra lies at the heart of many program analysis techniques. However, its operations can be expensive, precluding their application to polyhedra that involve many variables.
Howe, J. M. +5 more
core +1 more source
A polyhedral approach for a constrained quadratic 0–1 problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Faye, Alain, Trinh, Q.A.
openaire +3 more sources
Rare‐earth catalysts regulate lithium–sulfur battery chemistry through f‐orbital–mediated interactions, enabling simultaneous polysulfide adsorption and catalytic conversion on conductive carbon hosts. This synergistic control suppresses the shuttle effect, accelerates redox kinetics, and guides stable Li2S nucleation, providing a mechanistic framework
Fan Wang +5 more
wiley +1 more source
This paper presents a CFD modeling approach for a 19-rod bundle fuel assembly with spiral semi-cylindrical ribs, which potentially can be used for liquid metal cooled fast reactor, as well as a numerical simulation of flow and thermal behavior under ...
Hao Sun +5 more
doaj +1 more source
A polyhedral approach to quadratic assignment problem
Cataloged from PDF version of article.Includes bibliographical references.In this thesis, Quadratic Assignment Problem is considered. Since Quadratic Assignment Problem is JVP-bard, no polynomial time exact solution method exists. Proving optimality of
Köksaldı, Ahmet Sertaç Murat
core
On unbounded polyhedral convex set optimization problems
A polyhedral convex set optimization problem is given by a set-valued objective mapping from the $n$-dimensional to the $q$-dimensional Euclidean space whose graph is a convex polyhedron.
Löhne, Andreas, Hey, Niklas
core
Widening Polyhedra with Landmarks: 4th Asian Symposium, APLAS 2006, Sydney, Australia, November 8-10, 2006. Proceedings [PDF]
The abstract domain of polyhedra is sufficiently expressive to be deployed in verification. One consequence of the richness of this domain is that long, possibly infinite, sequences of polyhedra can arise in the analysis of loops.
Andy King +3 more
core +1 more source
A BN@G‐POSS/EP nanocomposite is developed for high‐frequency transformer insulation in power electronic transformers. Through synergistic interface engineering, it simultaneously enhances thermal conductivity, reduces viscosity, and improves electro‐thermal stability.
Jun Jiang +6 more
wiley +1 more source
The Jones Polynomial for Polyhedral Links
National Natural Science Foundation of China [10831001]In this paper, a general approach is presented to compute the Jones polynomial of polyhedral links introduced in [18].
金贤安 +3 more
core

