Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Distributed Loads: Problem Solving

Distributed Loads: Problem Solving

Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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...

Sequence Networks of Rotating Machines

Sequence Networks of Rotating Machines

A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...

Apparent Weight

Apparent Weight

True weight is the measure of the gravitational force acting on an object. However, if the object accelerates, its measured weight is different from its true weight. Similar observations can be made when the object is submerged in water. An object's weight in water is its apparent weight, which is equal to the difference between its true weight and the buoyant forces.
Consider a person standing on a bathroom scale inside an elevator. If the scale is accurate at rest, its reading equals the...

Mechanistic Models: Compartment Models in Individual and Population Analysis

Mechanistic Models: Compartment Models in Individual and Population Analysis

Mechanistic models are utilized in individual analysis using single-source data, but imperfections arise due to data collection errors, preventing perfect prediction of observed data. The mathematical equation involves known values (Xi), observed concentrations (Ci), measurement errors (εi), model parameters (ϕj), and the related function (ƒi) for i number of values. Different least-squares metrics quantify differences between predicted and observed values. The ordinary least squares (OLS)...

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...

You might also read

Related Articles

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

Sort by

Same author

Calculation of the molar absorptivity of polyphenols by using liquid chromatography with diode array detection: the case of carnosic acid.

Journal of chromatography. A·2004

Same author

Mass spectral fragmentations of cholesterol acetate oxidation products.

Rapid communications in mass spectrometry : RCM·2000

Same author

Replicator equations, maximal cliques, and graph isomorphism.

Neural computation·1999

Same author

An iterative pruning algorithm for feedforward neural networks.

IEEE transactions on neural networks·1997

Search research articles

Related Experiment Video

Updated: Jul 7, 2026

The Replica Set Method: A High-throughput Approach to Quantitatively Measure Caenorhabditis elegans Lifespan

The Replica Set Method: A High-throughput Approach to Quantitatively Measure Caenorhabditis elegans Lifespan

Published on: June 29, 2018

Approximating the maximum weight clique using replicator dynamics.

I R Bomze¹, M Pelillo, V Stix

¹Institut für Statistik und Decision Support Systems, Universität Wien, Universitätsstrasse 5, A-1010 Wien, Austria.

IEEE Transactions on Neural Networks

|February 6, 2008

Summary

This summary is machine-generated.

This study introduces a novel parallel, distributed heuristic for the maximum weight clique problem (MWCP). The approach uses biological dynamics principles to approximate solutions for this NP-hard combinatorial problem.

Related Experiment Videos

Last Updated: Jul 7, 2026

The Replica Set Method: A High-throughput Approach to Quantitatively Measure Caenorhabditis elegans Lifespan

The Replica Set Method: A High-throughput Approach to Quantitatively Measure Caenorhabditis elegans Lifespan

Published on: June 29, 2018

Area of Science:

Graph Theory
Combinatorial Optimization
Computational Biology

Background:

The maximum weight clique problem (MWCP) is an NP-hard generalization of the maximum cardinality clique problem.
Existing research has focused on unweighted graphs, neglecting efficient methods for weighted counterparts.
Approximating MWCP within a constant factor is also theoretically challenging.

Purpose of the Study:

To develop a parallel, distributed heuristic for approximating the MWCP.
To leverage continuous formulations and biological dynamics for solving combinatorial problems.
To address the issue of spurious solutions in continuous MWCP formulations.

Main Methods:

Formulating the MWCP as a continuous quadratic programming problem, generalizing the Motzkin-Straus theorem.
Introducing a regularized continuous formulation to eliminate spurious solutions.
Mapping the continuous formulation onto a parallel, distributed network governed by replicator equations from evolutionary game theory.

Main Results:

Theoretical guarantees that the replicator network yields correct MWCP solutions.
Demonstrated effectiveness of the proposed heuristic through extensive experiments on random and benchmark graphs.
Successful application of biological dynamics principles to a combinatorial optimization problem.

Conclusions:

The proposed parallel, distributed heuristic effectively approximates the MWCP.
The novel continuous formulation and replicator dynamics offer a robust solution to the MWCP.
This work bridges combinatorial optimization and mathematical biology with promising computational results.