Results 41 to 50 of about 469,123 (318)

Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training

open access: yes, 2006
Background: Particle Swarm Optimization (PSO) is an established method for parameter optimization. It represents a population-based adaptive optimization technique that is influenced by several "strategy parameters".
Meissner, Michael   +11 more
core   +1 more source

Transportation Network Optimization [PDF]

open access: yes, 2014
The longevity of transportation networks dates back to the age of ancient civilization, since that time the main objective has in essence remained the same: to facilitate the transportation of goods from one location to another using the most cost ...
Broomhead, P   +11 more
core   +1 more source

A Multi-Objective Tri-Level Algorithm for Hub-and-Spoke Network in Short Sea Shipping Transportation

open access: yes, 2023
Hub-and-Spoke (H&S) network modeling is a form of transport topology optimization in which network joins are connected through intermediate hub nodes.
Panagiotis Farmakis   +2 more
core   +1 more source

The (Glg)ABCs of cyanobacteria: modelling of glycogen synthesis and functional divergence of glycogen synthases in Synechocystis sp. PCC 6803

open access: yesFEBS Letters, EarlyView.
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee   +3 more
wiley   +1 more source

THE OPTIMIZATION APPROACH OF POSTAL TRANSPORTATION NETWORK BASED ON UNCAPACITATED FIXED CHARGE LOCATION MODEL IN CONDITIONS OF SLOVAK REPUBLIC [PDF]

open access: yesTransport Problems, 2015
The article deals with the possibilities of optimizing the postal transportation network with respect to planned road infrastructure. The research adopted in this article uses allocation models within graph theory to obtain results for addressed ...
Radovan MADLEŇÁK, Jozef ŠTEFUNKO
doaj  

Immiscible color flows in optimal transport networks for image classification

open access: yesFrontiers in Physics, 2023
In classification tasks, it is crucial to meaningfully exploit the information contained in the data. While much of the work in addressing these tasks is focused on building complex algorithmic infrastructures to process inputs in a black-box fashion ...
Alessandro Lonardi   +2 more
doaj   +1 more source

Optimization in telecommunication networks [PDF]

open access: yesStatistica Neerlandica, 2005
Network design and network synthesis have been the classical optimization problems in telecommunication for a long time. In the recent past, there have been many technological developments such as digitization of information, optical networks, Internet, and wireless networks. These developments have led to a series of new optimization problems.
openaire   +4 more sources

Optimizing the coherence of composite networks [PDF]

open access: yes2017 American Control Conference (ACC), 2017
We consider how to connect a set of disjoint networks to optimize the performance of the resulting composite network. We quantify this performance by the coherence of the composite network, which is defined by an $H_2$ norm of the system. Two dynamics are considered: noisy consensus dynamics with and without stubborn agents.
Erika Mackin, Stacy Patterson
openaire   +2 more sources

Valosin‐containing protein counteracts ATP‐driven dissolution of FUS condensates through its ATPase activity in vitro

open access: yesFEBS Letters, EarlyView.
Biomolecular condensates formed by fused in sarcoma (FUS) are dissolved by high ATP concentrations yet persist in cells. Using a reconstituted system, we demonstrate that valosin‐containing protein (VCP), an AAA+ ATPase, counteracts ATP‐driven dissolution of FUS condensates through its D2 ATPase activity.
Hitomi Kimura   +2 more
wiley   +1 more source

Optimal Sorting Networks [PDF]

open access: yes, 2014
This paper settles the optimality of sorting networks given in The Art of Computer Programming vol. 3 more than 40 years ago. The book lists efficient sorting networks with n <= 16 inputs. In this paper we give general combinatorial arguments showing that if a sorting network with a given depth exists then there exists one with a special form.
Daniel Bundala, Jakub Zavodny
openaire   +2 more sources

Home - About - Disclaimer - Privacy