Results 41 to 50 of about 151,397 (266)
Greedy algorithms: a review and open problems
Journal of Inequalities and ApplicationsGreedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms.
Andrea García
doaj +1 more source
Algorithms, 2019 In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle.
Napoleão Nepomuceno +2 more
doaj +1 more source
StaticGreedy: solving the scalability-accuracy dilemma in influence maximization
, 2013 Influence maximization, defined as a problem of finding a set of seed nodes to trigger a maximized spread of influence, is crucial to viral marketing on social networks.
Cheng, Suqi +4 more
core +1 more source
Some recent results in the analysis of greedy algorithms for assignment problems [PDF]
, 1993 We survey some recent developments in the analysis of greedy algorithms for assignment and transportation problems. We focus on the linear programming model for matroids and linear assignment problems with Monge property, on general linear programs ...
Faigle, Ulrich
core +4 more sources
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Greedy algorithms and poset matroids [PDF]
, 2013 We generalize the matroid-theoretic approach to greedy algorithms to the setting of poset matroids, in the sense of Barnabei, Nicoletti and Pezzoli (1998) [BNP].
Ferrari, Luca
core
Journal of Advance Research in Computer Science & Engineering (ISSN: 2456-3552), 2015 This paper describes the basic technological aspects of algorithm, algorithmic efficiency and Greedy algorithm. Algorithmic efficiency is the property of an algorithm which relate to the amount of resources use by the algorithm in computer sciences. An algorithm is considered efficient if its resource consumption (or computational cost) is at or below ...
Abhishek Jain +2 more
openaire +2 more sources
Discovery and Targeted Proteomic Studies Reveal Striatal Markers Validated for Huntington's Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Clinical trials for Huntington's disease (HD) enrolling persons before clinical motor diagnosis (CMD) lack validated biomarkers. This study aimed to conduct an unbiased discovery analysis and a targeted examination of proteomic biomarkers scrutinized by clinical validation. Methods Cerebrospinal fluid was obtained from PREDICT‐HD and
Daniel Chelsky +8 more
wiley +1 more source
Analysis of Performance of Dynamic Multicast Routing Algorithms
, 1998 In this paper, three new dynamic multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree, Topology Based Tree and Minimum Diameter Tree. A simulation analysis is presented showing various performance aspects of
Ballardie +16 more
core +2 more sources
Real‐World Performance of CSF Kappa Free Light Chains in the 2024 McDonald Criteria
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Kappa free light chains (KFLCs) in the cerebrospinal fluid (CSF) have a similar performance to CSF‐restricted oligoclonal bands (OCB) for multiple sclerosis (MS) diagnosis. To help with implementation, we set out to resolve several remaining uncertainties: (1) performance in a real‐world cohort and the 2024 McDonald criteria; (2 ...
Maya M. Leibowitz +11 more
wiley +1 more source