Results 31 to 40 of about 25,302 (170)
Fast greedy triangulation algorithms [PDF]
Proceedings of the tenth annual symposium on Computational geometry - SCG '94, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dickerson, Matthew T. +3 more
openaire +2 more sources
A new efficient RLF-like algorithm for the vertex coloring problem [PDF]
Yugoslav Journal of Operations Research, 2016 The Recursive Largest First (RLF) algorithm is one of the most popular greedy heuristics for the vertex coloring problem. It sequentially builds color classes on the basis of greedy choices.
Adegbindin Mourchid +2 more
doaj +1 more source
Greedy Firefly Algorithm for Optimizing Job Scheduling in IoT Grid Computing
Sensors, 2022 The Internet of Things (IoT) is defined as interconnected digital and mechanical devices with intelligent and interactive data transmission features over a defined network.
Adil Yousif +6 more
doaj +1 more source
Distributed greedy pursuit algorithms [PDF]
Signal Processing, 2014 For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among connected nodes.
Dennis Sundman +2 more
openaire +2 more sources
Revista de Matemática: Teoría y Aplicaciones, 2009 When cash becomes available in a company, there are several strategies that allow us to benefit from it. The problem is how much to invest, for how long, and using which of the investment options in order to get the maximum profit out of it.
Juan Flores +3 more
doaj +1 more source
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
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
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
Energy-Efficient Chain Formation Algorithm for Data Gathering in Wireless Sensor Networks
International Journal of Distributed Sensor Networks, 2012 In wireless sensor networks, since sensor nodes are distributed in inaccessible regions for data gathering, they need to be operated during an assigned time without battery recharging and relocation.
Se-Jung Lim, Myong-Soon Park
doaj +1 more source