Results 41 to 50 of about 148,724 (314)

A Fast Neural Network Learning Algorithm with Approximate Singular Value Decomposition

open access: yesInternational Journal of Applied Mathematics and Computer Science, 2019
The learning of neural networks is becoming more and more important. Researchers have constructed dozens of learning algorithms, but it is still necessary to develop faster, more flexible, or more accurate learning algorithms.
Jankowski Norbert, Linowiecki Rafał
doaj   +1 more source

Direct Aperture Optimization for Intensity Modulated Radiation Therapy: Two Calibrated Metaheuristics and Liver Cancer Case Study [PDF]

open access: yesInternational Journal of Industrial Engineering and Production Research, 2022
Integrated treatment planning for cancer patients has high importance in intensity modulated radiation therapy (IMRT). Direct aperture optimization (DAO) is one of the prominent approaches used in recent years to attain this goal.
Ali Fallahi   +2 more
doaj  

Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines. [PDF]

open access: yesPLoS ONE, 2014
Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings.
Fernando Soler-Toscano   +3 more
doaj   +1 more source

The U-curve optimization problem: improvements on the original algorithm and time complexity analysis

open access: yesCoRR, 2014
The U-curve optimization problem is characterized by a decomposable in U-shaped curves cost function over the chains of a Boolean lattice. This problem can be applied to model the classical feature selection problem in Machine Learning. Recently, the U-Curve algorithm was proposed to give optimal solutions to the U-curve problem.
Marcelo da Silva Reis   +2 more
openaire   +2 more sources

Clustering Affine Subspaces: Algorithms and Hardness [PDF]

open access: yes, 2012
We study a generalization of the famous k-center problem where each object is an affine subspace of dimension Δ, and give either the first or significantly improved algorithms and hardness results for many combinations of parameters.
Lee, Euiwoong
core   +1 more source

Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms [PDF]

open access: yesInternational Journal of Applied Mathematics and Computer Science, 2007
Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard AlgorithmsThe paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multi-objective shortest path (MOSP) problems is given.
openaire   +1 more source

Hybrid Deep Reinforcement Learning Considering Discrete-Continuous Action Spaces for Real-Time Energy Management in More Electric Aircraft

open access: yesEnergies, 2022
The increasing number and functional complexity of power electronics in more electric aircraft (MEA) power systems have led to a high degree of complexity in modelling and computation, making real-time energy management a formidable challenge, and the ...
Bing Liu   +4 more
doaj   +1 more source

Fifty years of scheduling: a survey of milestones [PDF]

open access: yes, 2009
Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear.
Strusevich, Vitaly A.   +5 more
core   +1 more source

Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies

open access: yesFEBS Open Bio, EarlyView.
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli   +8 more
wiley   +1 more source

Analysis of solving methods and complexity of algorithmics problems in Lithuanian and Baltic Olympiads

open access: yesLietuvos matematikos rinkinys, 2003
Lithuanian Olympiads in Informatics are being organized since 1990. Each Olympiad consists of three rounds. The final (national) one is divided into two parts, there are also elder and younger divisions. Each year there are supplied a lot of tasks. The paper deals with algorithmic problems of all the Lithuanian olympiads of school students and all the ...
Valentina Dagienė, Jūratė Skūpienė
openaire   +2 more sources

Home - About - Disclaimer - Privacy