Results 141 to 150 of about 65,579 (181)
Some of the next articles are maybe not open access.

The minimum chromatic violation problem: A polyhedral approach

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Braga, M.   +5 more
openaire   +2 more sources

Factors of polyhedral spectra: a computational approach

Journal of Molecular Structure: THEOCHEM, 1995
Abstract Symmetric operations of regular polyhedra are performed by using a computational method without applying any fragmentation rules suggested earlier by different workers. The desired factors are obtained by a judicious choice of the initial approximations.
Swarna M. Patra, Rama K. Mishra
openaire   +2 more sources

Multiple Instance Learning by Polyhedral Approaches

2021
Multiple Instance Learning (MIL) is a variant of traditional supervised learning that has received a considerable amount of attention due to its applicability to real-world problems such as drug activity prediction and image classification. In particular, we are interested in the binary classification case where the objective is to construct a ...
Annabella Astorino   +2 more
openaire   +2 more sources

Survivable network design using polyhedral approaches

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011), 2011
We consider the problem of designing a survivable telecommunication network using facilities of a fixed capacity. Given a graph G = (V,E), the traffic demand among the nodes, and the cost of installing facilities on the edges of G, we wish to design the minimum cost network, so that under any single edge failure, the network permits the flow of all ...
openaire   +1 more source

Polyhedral approximation approach to molecular orbital graphics

Journal of Molecular Graphics, 1986
Abstract Interactive molecular orbital display and manipulation system is developed under the concept of polyhedral approximation of equivalued surfaces of orbital and density functions. Two new methods for generating polyhedral data, lscell-based’ and ‘propagation’ methods, are presented.
Akio Koide, Akio Doi, Koichi Kajioka
openaire   +1 more source

Task Analysis: A Polyhedral Dynamics Approach

Proceedings of the Human Factors Society Annual Meeting, 1990
A relatively new mathematical modeling theory and methodology, Q-analysis, appears to be suited for dealing with issues that concern complex systems and the users of those systems. The method of Q-analysis is concerned with the relations between the elements of a system and their often complex implicit structure.
openaire   +1 more source

A spectral approach to polyhedral dimension

Mathematical Programming, 1990
The author defines a new dimension function for polytopes using the convex hull of the edge or arc incidence vectors of Hamiltonian tours and other objects in graphs. A matrix with rows equal to the extreme points of the polytope and supplemented with a column of units is constructed. The matrix is reduced to diagonal form by orthogonal transformations.
openaire   +1 more source

A polyhedral approach to the alldifferent system

Mathematical Programming, 2010
This paper examines the facial structure of the convex hull of integer vectors satisfying a system of alldifferent predicates, also called an alldifferent system. The underlying analysis is based on a property, called inclusion, pertinent to such a system.
D. Magos, I. Mourtos, G. Appa
openaire   +1 more source

Fairness in Capacitated Networks: A Polyhedral Approach

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007
The problem of fair and feasible allocation of user throughputs in capacitated networks is investigated. The main contribution of the paper is a novel geometric approach, which facilitates to generalize several throughput allocation strategies, most importantly max-min fairness, from the traditional "fixed-path" model to a more versatile, routing ...
G. Retvari, J. J. Biro, T. Cinkler
openaire   +1 more source

New Synthesis Approach for Expandable Polyhedral Linkages

Volume 5A: 38th Mechanisms and Robotics Conference, 2014
This paper presents a new synthesis approach for expandable polyhedral linkages, which are synthesized by inserting appropriate link groups into the faces of polyhedron and interconnecting them by a special composite hinges (called gusset by K. Wohlhart).
Ying Zhang   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy