Results 11 to 20 of about 305,625 (281)
Greedy Rectilinear Drawings [PDF]
Theoretical Computer Science, 2018 A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path.
C Batini +19 more
core +5 more sources
Combinatorics, Probability and Computing, 2012 We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not been crossed ...
Orenshtein, Tal, Shinkar, Igor
core +3 more sources
Greedy Criterion in Orthogonal Greedy Learning [PDF]
IEEE Transactions on Cybernetics, 2018 Orthogonal greedy learning (OGL) is a stepwise learning scheme that starts with selecting a new atom from a specified dictionary via the steepest gradient descent (SGD) and then builds the estimator through orthogonal projection. In this paper, we found that SGD is not the unique greedy criterion and introduced a new greedy criterion, called as ...
Lin Xu +5 more
openaire +2 more sources
Totally Greedy Coin Sets and Greedy Obstructions [PDF]
The Electronic Journal of Combinatorics, 2008 A coin set is a strictly increasing list of positive integers that always begins with 1. A coin set is called greedy when the simple greedy change-making algorithm always produces the fewest number of coins in change. Here, the greedy change-making algorithm repeatedly selects the largest denomination coin less than the remaining amount until it has ...
Cowen, L. J. +2 more
openaire +2 more sources
Algorithmica, 2017 Algorithmica 80(4), 1298 - 1314 (2018).
Faigle, Ulrich +2 more
openaire +4 more sources
Beware greedy algorithms [PDF]
Journal of Animal Ecology, 2019 Nestedness – the tendency for specialist species to interact with subsets of the species that generalist species interact with – is a pervasive feature of empirical mutualistic communities (Bascompte, Jordano, Melián, & Olesen, 2003). While theoretical work has discovered important dynamical implications of nestedness, such as enhanced community ...
Benno I. Simmons +2 more
openaire +2 more sources
Contrasting of Various Algorithmic Techniques to Solve Knapsack 0-1 Problem
JOIV: International Journal on Informatics Visualization, 2020 This paper will point of convergence on a relative assessment and estimation of the dynamic programming, B&B, Greedy and Genetic algorithm including of the intricacy of time prerequisites, and the necessary programming endeavors and inspect the absolute ...
Yogesh Awasthi, Ashish Sharma
doaj +1 more source
A New Greedy Algorithm for the Curriculum-based Course Timetabling Problem
Düzce Üniversitesi Bilim ve Teknoloji Dergisi, 2023 This study describes a novel greedy algorithm for optimizing the well-known Curriculum-Based Course Timetabling (CB-CTT) problem. Greedy algorithms are a good alternative to brute-force and evolutionary algorithms, which take a long time to execute in ...
Tansel Dökeroğlu +2 more
doaj +1 more source
Lebesgue type inequalities for quasi-greedy bases [PDF]
, 2012 We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N- term error of approximation times a function of N which depends on the democracy functions and the ...
Garrigós, Gustavo +2 more
core +2 more sources