Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

45
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
45
Optimal Foraging00:48

Optimal Foraging

12.0K
How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.
12.0K
Heuristics01:21

Heuristics

81
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
81
Inclusive Fitness00:57

Inclusive Fitness

35.9K
Most altruistic behavior—in which one animal helps another at a cost to themselves—occurs between relatives. Scientists think these altruistic behaviors evolved because they increase the inclusive fitness of the animal providing help.
35.9K
Decision Making: P-value Method01:09

Decision Making: P-value Method

5.3K
The process of hypothesis testing based on the P-value method includes calculating the P- value using the sample data and interpreting it.
First, a specific claim about the population parameter is proposed. The claim is based on the research question and is stated in a simple form. Further, an opposing statement to the claim  is also stated. These statements can act as null and alternative hypotheses:  a null hypothesis would be a neutral statement while the alternative hypothesis can...
5.3K
Combinatorial Gene Control02:33

Combinatorial Gene Control

8.3K
Combinatorial gene control is the synergistic action of several transcriptional factors to regulate the expression of a single gene. The absence of one or more of these factors may lead to a significant difference in the level of gene expression or repression.
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
8.3K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Autoantibodies to IL-1Ra and PGRN in severe COVID-19 are associated with inflammation-induced hyperphosphorylated antigen isoforms.

Nature communications·2026
Same author

Plasmacytic markers as immunotherapeutic targets for primary CD20-negative aggressive B-cell lymphomas.

British journal of haematology·2026
Same author

Reprogramming of stroma-derived chemokine networks drives the loss of tissue organization in nodal B cell lymphoma.

Nature cancer·2026
Same author

Impact of Perforin 1 A91V germ line background in patients with aggressive B-NHL treated with R-CHOP.

Blood advances·2026
Same author

Axicabtagene ciloleucel in combination with rituximab for refractory large B cell lymphoma: the phase 2, single-arm ZUMA-14 trial.

Nature cancer·2026
Same author

Impact of Perforin 1 A91V germ line background in patients with aggressive B-NHL treated with R-CHOP.

Blood advances·2025
Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026
Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026
Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026
Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026
Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026
Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026
See all related articles

Related Experiment Video

Updated: Jun 12, 2025

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.4K

Optimizing Monotone Chance-Constrained Submodular Functions Using Evolutionary Multiobjective Algorithms.

Aneta Neumann1, Frank Neumann2

  • 1Optimisation and Logistics, The University of Adelaide, Adelaide, Australia aneta.neumann@adelaide.edu.au.

Evolutionary Computation
|September 24, 2024
PubMed
Summary
This summary is machine-generated.

Evolutionary multi-objective algorithms demonstrate improved performance for chance-constrained submodular optimization problems. These algorithms, including GSEMO, NSGA-II, and SPEA2, outperform greedy methods in complex network scenarios.

Keywords:
Chance constraintsevolutionary multiobjective agorithmssubmodular functions.

More Related Videos

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

11.6K
Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.0K

Related Experiment Videos

Last Updated: Jun 12, 2025

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.4K
The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

11.6K
Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.0K

Area of Science:

  • Optimization
  • Computer Science
  • Operations Research

Background:

  • Real-world optimization problems frequently utilize submodular functions.
  • Uncertainties in these problems can lead to constraint violations.
  • Evolutionary multi-objective algorithms (EMOAs) are increasingly applied to constrained submodular problems.

Purpose of the Study:

  • To present the first runtime analysis of EMOAs for chance-constrained submodular functions.
  • To investigate the performance of the GSEMO algorithm under probabilistic constraints.
  • To compare EMOAs with greedy algorithms on submodular network optimization tasks.

Main Methods:

  • Runtime analysis of the GSEMO algorithm for bi-objective formulations.
  • Utilizing tail bounds to assess solution feasibility under chance constraints (probability α).
  • Experimental evaluation of GSEMO, NSGA-II, and SPEA2 on submodular network problems.

Main Results:

  • GSEMO achieves comparable worst-case performance guarantees to greedy algorithms for monotone submodular functions under specific weight distributions.
  • Tail bounds in one formulation can hinder GSEMO's performance for non-monotone submodular functions.
  • EMOAs show significant performance gains over greedy algorithms in experimental submodular chance-constrained network problems.

Conclusions:

  • EMOAs offer a robust approach for tackling submodular optimization with probabilistic constraints.
  • The choice of bi-objective formulation and handling of monotonicity are crucial for algorithm performance.
  • EMOAs represent a promising advancement over traditional greedy methods for complex, uncertain optimization challenges.