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 Experiment Videos

Searching and gradualness

R Rada

    Bio Systems
    |January 1, 1981
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a search algorithm class for finding near-minimum value elements in a power set. The algorithms leverage search space gradualness, where higher-valued sets are subsets of larger ones, to improve search efficiency.

    Related Concept Videos

    You might also read

    Related Articles

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

    Sort by
    Same author

    Advanced zirconia ceramics stabilized with yttria and magnesia: Structure and Vickers microhardness.

    Journal of the mechanical behavior of biomedical materials·2022
    Same author

    Insulin resistance and gray matter volume in neurodegenerative disease.

    Neuroscience·2014
    Same author

    Gradualness facilitates knowledge refinement.

    IEEE transactions on pattern analysis and machine intelligence·2011
    Same author

    Transanal rectocele repair using linear stapler and bioabsorbable staple line reinforcement material: short-term results of a prospective study.

    Diseases of the colon and rectum·2009
    Same author

    Evaluation by three-dimensional anal endosonography of injectable silicone biomaterial (PTQ) implants to treat fecal incontinence: long-term localization and relation with the deterioration of the continence.

    Techniques in coloproctology·2009
    Same author

    Evaluation of the use of PTQ implants for the treatment of incontinent patients due to internal anal sphincter dysfunction.

    Colorectal disease : the official journal of the Association of Coloproctology of Great Britain and Ireland·2007
    Same journal

    Ruliological Resilience: Pattern Restoration and Robustness in Wolfram Patterns. A Basis for Regeneration, Not Just in Cone Shells?

    Bio Systems·2026
    Same journal

    The quantum-to-classical transducer: A thermodynamic and quantum mechanical framework for the emergence of bioenergetics.

    Bio Systems·2026
    Same journal

    Forward-backward gene expression binarization for boolean state inference over a known regulatory network.

    Bio Systems·2026
    Same journal

    Partial-label metric ceilings for evaluating gene regulatory networks inferred from single-cell foundation models.

    Bio Systems·2026
    Same journal

    The impedance mismatch theory: A non-equilibrium thermodynamic framework for a shared energetic stress pathway in neurodegeneration.

    Bio Systems·2026
    Same journal

    Immune signal-status misclassification: A theoretical framework for biological status assignment and failed status resolution.

    Bio Systems·2026
    See all related articles

    Area of Science:

    • Computer Science
    • Optimization Theory
    • Set Theory

    Background:

    • Search spaces are often structured as power sets, where finding elements with near-minimum values is the primary objective.
    • The efficiency of search algorithms is significantly influenced by the inherent structure and properties of the search space.
    • Gradualness in a search space, where higher-valued elements of a certain cardinality are subsets of higher-valued elements of the next cardinality, can facilitate search processes.

    Purpose of the Study:

    • To propose a class of search algorithms designed to efficiently navigate power set search spaces.
    • To formally define and analyze the concept of search space gradualness.
    • To establish a formal relationship between search space gradualness and the performance of proposed search algorithms.

    Main Methods:

    Related Experiment Videos

    • Elements of the power set S are treated as alternatives in a search space, with each element assigned a value.
    • A class of search algorithms, denoted A(j), is proposed, where each algorithm generates samples of cardinality i+1 by emphasizing the j lowest-valued elements from samples of cardinality i.
    • Search space gradualness and algorithm performance are formally defined to enable theoretical analysis.

    Main Results:

    • The proposed algorithms generate a series of samples S'(1), ..., S'(k) from the power set, with elements in S'(i) having cardinality i.
    • A formal framework is established to quantify search space gradualness.
    • The relationship between the degree of gradualness in the search space and the performance of the A(j) algorithms is formally established.

    Conclusions:

    • Search space gradualness is a key property that can be exploited to design more efficient search algorithms.
    • The proposed class of algorithms, A(j), demonstrates a method for leveraging gradualness to improve the search for near-minimum value elements.
    • Formalizing the connection between gradualness and performance provides a theoretical basis for algorithm design and analysis in power set search spaces.