ABSTRACT: This article examines some of the properties of quasi-Fejer sequences when used in quasi-gradiental techniques as an alternative to stochastic search techniques for optimizing unconstrained ...
Article Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to ...
Prior to SageMath 9.1, CPLEXBackend was available as part of the SageMath source tree, from which it would be built as an "optional extension" if the proprietary ...
GurobiBackend has previously been available as part of the SageMath source tree, from which it is built as an "optional extension" if the proprietary Gurobi library ...
The objective of the 3D-SCALO problem is to assign the given components to optimal mounting surfaces and position them at the best locations, while satisfying the requirements for (1) heat dissipation ...
Creative Commons (CC): This is a Creative Commons license. Attribution (BY): Credit must be given to the creator. There is a need for design strategies that can support rapid and widespread deployment ...
Advances in novel hardware devices and architectures allow Spiking Neural Network (SNN) evaluation using ultra-low power, mixed-signal, memristor crossbar arrays. As individual network sizes quickly ...
In the field of genomics, bioinformatics pipelines play a crucial role in processing and analyzing vast biological datasets. These pipelines, consisting of interconnected tasks, can be optimized for ...
NVIDIA's cuOpt leverages GPU technology to drastically accelerate linear programming, achieving performance up to 5,000 times faster than traditional CPU-based solutions. The landscape of linear ...
Integer Linear Programming (ILP) is the foundation of combinatorial optimization, which is extensively applied across numerous industries to resolve challenging decision-making issues. Under a set of ...
Abstract: In this paper, a design framework based on integer linear programming is proposed for optimizing sparse array structures. We resort to binary vectors to formulate the design problem for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results