Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Agris Pentjuss

dblp:209/8117 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2017
0000-0001-7880-5130ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › global optimization
stochastic global optimization
0.112017
SpaceScanner: COPASI wrapper for automated management of global stochastic optimization experiments · Bioinform. 2017

Methods — techniques the papers use, named apart from their topics

parallel optimization runs · 0.6consensus-based termination · 0.6
YearPublicationVenuePosition
2017 SpaceScanner: COPASI wrapper for automated management of global stochastic optimization experiments
abstract
MOTIVATION: Due to their universal applicability, global stochastic optimization methods are popular for designing improvements of biochemical networks. The drawbacks of global stochastic optimization methods are: (i) no guarantee of finding global optima, (ii) no clear optimization run termination criteria and (iii) no criteria to detect stagnation of an optimization run. The impact of these drawbacks can be partly compensated by manual work that becomes inefficient when the solution space is large due to combinatorial explosion of adjustable parameters or for other reasons. RESULTS: SpaceScanner uses parallel optimization runs for automatic termination of optimization tasks in case of consensus and consecutively applies a pre-defined set of global stochastic optimization methods in case of stagnation in the currently used method. Automatic scan of adjustable parameter combination subsets for best objective function values is possible with a summary file of ranked solutions. AVAILABILITY AND IMPLEMENTATION: https://github.com/atiselsts/spacescanner . CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Atis Elsts, Agris Pentjuss, Egils Stalidzans
Bioinform.2