Results 241 to 250 of about 10,934,980 (285)
Some of the next articles are maybe not open access.
A Simplicial Approach to the Determination of an Integer Point of a Simplex
Mathematics of Operations Research, 1998We propose an algorithm to find an integer point of a simplex. The algorithm is based on an integer labeling rule and a triangulation of the space. Starting at an integer point, the algorithm leaves it along one of n rays and generates a sequence of adjacent simplices of varying dimension.
Chuangyin Dang, Hans van Maaren
openaire +3 more sources
Novel approaches in fighting herpes simplex virus infections [PDF]
Expert Review of Anti-Infective Therapy, 2009 The development of novel strategies to eradicate herpes simplex virus (HSV) is a global public health priority. While acyclovir and related nucleoside analogues provide successful modalities for treatment and suppression, HSV remains highly prevalent worldwide and is a major cofactor fueling the HIV epidemic.
Betsy C Herold, Esra Fakıoğlu
exaly +3 more sources
An orthogonal projection approach to simplex growing algorithm
2015 7th Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing (WHISPERS), 2015Simplex growing algorithm (SGA) is an endmember finding algorithm which grows simplexes one vertex at a time by finding vertexes which yield maximal simplex volumes via determinant calculation. This paper presents a new version of SGA, called orthogonal projection based simplex growing algorithm (OPSGA) which takes advantage of a simplex's geometric ...
Hsiao-Chi Li, Chein-I Chang
openaire +1 more source
Downhill simplex approach for vehicle headlights detection
SPIE Proceedings, 2014Nighttime vehicle detection is an essential problem to be solved in the development of highway surveillance systems that provide information about the vehicle speed, traffic volume, and traffic jams, and so on. In this paper, a novel downhill simplex approach for vehicle headlights detection is presented. In the proposed approach, a rough position of
Ho-Joong Kang +3 more
openaire +1 more source
A Primal Simplex Approach to Pure Processing Networks
Management Science, 1986Pure processing network problems are minimum cost flow problems in which the flow entering or leaving a node may be constrained to do so in given proportions. In this paper, new theoretical results concerning pure processing networks are developed, and, based on these results, two new primal simplex variants are presented.
Chou-Hong J. Chen, Michael Engquist
openaire +1 more source
Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
ORSA Journal on Computing, 1992We report tests of CPLP, a piecewise-linear simplex implementation based on the XMP subroutine library. Using test problems of various shapes and origins, we judge CPLP against a comparable linear bounded-variable simplex code that is applied to equivalent linear programs.
Robert Fourer, Roy E. Marsten
openaire +3 more sources
Geometric approach to statistical analysis on the simplex
Stochastic Environmental Research and Risk Assessment, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pawlowsky-Glahn, V., Egozcue, J. J.
openaire +1 more source
A Simplex Approach to the Optimum Determination of the Domain of Attraction
IMA Journal of Mathematical Control and Information, 1988A class of nonlinear autonomous systems is considered in \(R^ n\). The problem is to determine the region of asymptotic stability or domain of attraction (DOA). The approach is based on Lyapunov's indirect method but the a priori requirements to define the structure of the Lyapunov function are avoided.
openaire +1 more source
A simple approach to the simplex method
Chemia Analityczna, 2008Zasady metody planowania sympleksowego, odniesione do przestrzeni n-wymiarowej (n-D), są zaprezentowane z użyciem pojęcia iloczynu skalarnego, znanego z algebry elementarnej. Elementy macierzy planowania sympleksowego, odniosione do przestrzeni n-D, są otrzymane na podstawie prostych obliczeń.
Tadeusz Michałowski +2 more
openaire +1 more source
A nonlinear simplex search approach for multi-objective optimization
2011 IEEE Congress of Evolutionary Computation (CEC), 2011This paper proposes an algorithm for dealing with nonlinear and unconstrained multi-objective optimization problems (MOPs). The proposed algorithm adopts a nonlinear simplex search scheme in order to obtain multiple approximations of the Pareto optimal set. The search is directed by a well-distributed set of weighted vectors.
Saúl Zapotecas Martínez +2 more
openaire +2 more sources