Results 111 to 120 of about 364,629 (281)
Automated Crossdating With a Modified Version of the Dendrochronology Program CROS
Archaeometry, EarlyView.ABSTRACT The basic principle of dendrochronology involves matching patterns of tree‐ring widths, with the objective of dating wood of unknown age. The various crossdating procedures rely on statistical methods. The legacy CROS program written in FORTRAN IV contains algorithms, variants of which have been incorporated into modern crossdating programs ...
Michael O. Schwartz
wiley +1 more source
Computing Skinning Weights via Convex Duality
Computer Graphics Forum, EarlyView.We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Gentoo Linux for Neuroscience - a replicable, flexible, scalable, rolling-release environment that provides direct access to development software [PDF]
Research Ideas and Outcomes, 2017 Horea-Ioan Ioanas +2 more
doaj +2 more sources
Using portable monitoring for heterogeneous clusters on Windows and Linux operating systems
Journal of Computer Science and Technology, 2003 This paper describes the advances obtained with the XPVM-W95 2.0, a novel monitoring tool for parallel applications that employ PVM-W95 (PVM for Windows) as well as PVM for Linux.
Daniel Kikuti +2 more
doaj
Encoding Occupancy in Memory Location for Efficient and Compact High‐Resolution Voxel Structures
Computer Graphics Forum, EarlyView.We encode information about geometric structure into the pointers of a sparse voxel directed acyclic graph (SVDAG). Each pointer carries information about the structure of the node it points to. Our encoding improves ray tracing performance and reduces model size in memory.
Jaina Modisett, Markus Billeter
wiley +1 more source
Certification of Open Source Software Compliance: Insights From a Conjoint Experiment
Information Systems Journal, EarlyView.ABSTRACT Open source software (OSS) is becoming increasingly crucial for companies as they use OSS components in a wide range of products, including cars, smart‐home equipment, and many more, as well as in their internal processes. However, OSS comes with regulations and licensing conditions with which companies need to comply.
Michael A. Zaggl +2 more
wiley +1 more source
Exact solution algorithms for biobjective mixed integer programming problems
International Transactions in Operational Research, EarlyView.Abstract We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem
Deniz Emre, Özlem Karsu, Firdevs Ulus
wiley +1 more source
A fast metaheuristic approach for the planar multiple obnoxious facility location problem
International Transactions in Operational Research, EarlyView.Abstract The multiple obnoxious facility location problem is one of the most studied problems in the literature of the obnoxious facility location problems family. In this work, we propose an alternative algorithmic approach for this problem, based on an efficient metaheuristic procedure over a discretization of the plane based on Voronoi diagrams ...
Sergio Salazar +2 more
wiley +1 more source
Современные информационные технологии и IT-образованиеThe current situation in the world, characterized by sanctions pressure, disruption of logistics, trade, industrial and technological connections and the deepening digitalization of society, has led to a change in the state’s strategy towards the need to
Elena Smirnova +2 more
doaj +1 more source
An iterated greedy‐based metaheuristic with local search for the rank pricing problem
International Transactions in Operational Research, EarlyView.Abstract The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction ...
Herminia I. Calvete +3 more
wiley +1 more source