Filters








18,566 Hits in 2.9 sec

Characterizing problems for realizing policies in self-adaptive and self-managing systems

Sowmya Balasubramanian, Ron Desmarais, Hausi A. Müller, Ulrike Stege, S. Venkatesh
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wvv27s77dvd5flktsj246kcxwu" style="color: black;">Proceeding of the 6th international symposium on Software engineering for adaptive and self-managing systems - SEAMS &#39;11</a> </i> &nbsp;
These mathematical structures, imposed on the underlying problem, progressively increase the quality of the solutions obtained when using the greedy optimization technique.  ...  In particular, we introduce a first precise characterization of goal policies for optimization problems. iv Secondly, this thesis introduces a mathematical framework that adds structure to the underlying  ...  These mathematical structures, imposed on the underlying problem, progressively increase the quality of the solutions obtained using the greedy optimization technique.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1988008.1988019">doi:10.1145/1988008.1988019</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icse/BalasubramanianDMSV11.html">dblp:conf/icse/BalasubramanianDMSV11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pzrdljjflrb7jdgvk2yi4cq7ku">fatcat:pzrdljjflrb7jdgvk2yi4cq7ku</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814163904/https://dspace.library.uvic.ca/bitstream/handle/1828/4487/Balasubramanian_Sowmya_MSc_2013.pdf?sequence=3" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5e/bc/5ebc7b1a50a61a89b5303a6e29a90d859896ebc2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1988008.1988019"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Page 1214 of Mathematical Reviews Vol. , Issue 83c [page]

<span title="">1983</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Mathematical structures underlying greedy algorithms. Fundamentals of computation theory (Szeged, 1981), pp. 205-209, Lecture Notes in Comput. Sci., 117, Springer, Berlin, 1981.  ...  This is one of the very few examples when mathematical structures are defined by their algorithmic behavior (another example is a Euclidean ring).  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1983-03_83c/page/1214" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1983-03_83c/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Incremental Parametric Development of Greedy Algorithms

Dominique Cansell, Dominique Méry
<span title="">2007</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
Our first contribution is a re-modelling of Curtis's results in the event B framework and a mechanical checking of theorems on greedy algorithms The second contribution is the reuse of the mathematical  ...  The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properties.  ...  The greedy method is effective, when properties are satisfied by the underlying mathematical structures. Like S.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2007.05.028">doi:10.1016/j.entcs.2007.05.028</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2bh3z7y2ejefjbmgc7olvshwpq">fatcat:2bh3z7y2ejefjbmgc7olvshwpq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224014909/https://core.ac.uk/download/pdf/82077567.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/13/9b/139b442ce7210185f82b122154edfb21fdab22ed.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2007.05.028"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Submodular linear programs on forests

Ulrich Faigle, Walter Kern
<span title="">1996</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o653fqsowvcyrhw6p4gdmpdkwm" style="color: black;">Mathematical programming</a> </i> &nbsp;
We solve the problem by optimal greedy algorithms for rooted forests as underlying structures. Other solvable cases are also discussed.  ...  A general linear programming model for an order-theoretic analysis of both Edmonds' ~eedy algorithm for matroids and the NW-comer rule for transportation problems with Monge costs is introduced.  ...  Bipartite graphs with Monge property have an underlying greedoid structure (cf. [4] ), which might suggest greedoids as a common model for Edmond's and Hoffman's greedy algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf02592089">doi:10.1007/bf02592089</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ltvmvzwkgfhqdjo5apsyaqhsve">fatcat:ltvmvzwkgfhqdjo5apsyaqhsve</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921203434/https://ris.utwente.nl/ws/files/6633518/Faigle96submodular.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4e/a5/4ea5fb83a392fb5fbc0cd76c47697dbb4bfd7eb3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf02592089"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Optimization Distribution Method of Computer Sensor Network Communication Based on the Linear Planning Model

Xiaohui Li, Xin Su, Nansi He, Anil Sharma, Pradeep Kumar Singh
<span title="2022-03-26">2022</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zlknqk4ahbcsthbafxw55emm7a" style="color: black;">Journal of Sensors</a> </i> &nbsp;
Under the same conditions, the average request acceptance rate based on the G-kSP algorithm is about 95.4% and about 92.3%, and the greedy deployment algorithm is about 81.7%.  ...  Based on the overall structure of service chain deployment, the integer linear programming model is introduced to make mathematical modeling, so that network resources and load balancing can be effectively  ...  greedy algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2022/7520749">doi:10.1155/2022/7520749</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/haborz52cbaxbh4sgdt3wd67me">fatcat:haborz52cbaxbh4sgdt3wd67me</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220421191524/https://downloads.hindawi.com/journals/js/2022/7520749.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6f/63/6f63c98ab5d2ce0f3177760d1b386e3a1343b804.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2022/7520749"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Page 571 of Mathematical Reviews Vol. , Issue 95a [page]

<span title="">1995</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Special cases of the above problems are given, for which greedy algorithms already yield the optimal solution, and the use of greedy algorithms for heuristics in other cases is discussed.  ...  In Section 4 the set of linear programming problems for which greedy algorithms yield the optimal solution is expanded.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1995-01_95a/page/571" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1995-01_95a/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

The greedy trap and learning from mistakes

David Ginat
<span title="">2003</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/42mrbbmjbfdtbbepad2fzixmum" style="color: black;">Proceedings of the 34th SIGCSE technical symposium on Computer science education - SIGCSE &#39;03</a> </i> &nbsp;
In particular, we noticed a repeated erroneous trend of turning to intuitive, but inadequate greedy algorithmic solutions.  ...  The paper displays the student errors and our capitalization-on-errors approach, with colorful and novel algorithmic tasks.  ...  Another aspect is that of task analysis, with respect to seeking underlying regularities: one may try to identify an underlying mathematical pattern, as a basis for the solution.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/611892.611920">doi:10.1145/611892.611920</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigcse/Ginat03.html">dblp:conf/sigcse/Ginat03</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oyamrav635dcrcmdlqypacnoru">fatcat:oyamrav635dcrcmdlqypacnoru</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809153039/http://www.tau.ac.il/~csedu/greedy_trap.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/34/ea/34ea88796979721646982545a2e2dc72100a1b8e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/611892.611920"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

The greedy trap and learning from mistakes

David Ginat
<span title="">2003</span> <i title="ACM Press"> Proceedings of the 34th SIGCSE technical symposium on Computer science education - SIGCSE &#39;03 </i> &nbsp;
In particular, we noticed a repeated erroneous trend of turning to intuitive, but inadequate greedy algorithmic solutions.  ...  The paper displays the student errors and our capitalization-on-errors approach, with colorful and novel algorithmic tasks.  ...  Another aspect is that of task analysis, with respect to seeking underlying regularities: one may try to identify an underlying mathematical pattern, as a basis for the solution.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/611917.611920">doi:10.1145/611917.611920</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mr5nl6eg5vbjngeckz5yfxknhy">fatcat:mr5nl6eg5vbjngeckz5yfxknhy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809153039/http://www.tau.ac.il/~csedu/greedy_trap.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/34/ea/34ea88796979721646982545a2e2dc72100a1b8e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/611917.611920"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

The greedy trap and learning from mistakes

David Ginat
<span title="2003-01-11">2003</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzoq6upx4ndyrd7qaolzbaeuca" style="color: black;">ACM SIGCSE Bulletin</a> </i> &nbsp;
In particular, we noticed a repeated erroneous trend of turning to intuitive, but inadequate greedy algorithmic solutions.  ...  The paper displays the student errors and our capitalization-on-errors approach, with colorful and novel algorithmic tasks.  ...  Another aspect is that of task analysis, with respect to seeking underlying regularities: one may try to identify an underlying mathematical pattern, as a basis for the solution.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/792548.611920">doi:10.1145/792548.611920</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/46xyt2bu4vdxbgo3qlgw7jxczy">fatcat:46xyt2bu4vdxbgo3qlgw7jxczy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809153039/http://www.tau.ac.il/~csedu/greedy_trap.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/34/ea/34ea88796979721646982545a2e2dc72100a1b8e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/792548.611920"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Page 2929 of Mathematical Reviews Vol. , Issue 2002D [page]

<span title="">2002</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Theoretical frameworks dealing with the optimality of greedy methods, including greedoids and matroids, consider a greedy rule known as the best-in greedy algorithm.  ...  For the web version of Mathematical Reviews, see http: //www.ams.org/mathscinet  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2002-04_2002d/page/2929" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2002-04_2002d/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Beware greedy algorithms

Benno I. Simmons, Christoph Hoeppke, William J. Sutherland, Anna Eklöf
<span title="2019-03-15">2019</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mz55axcfibbgpivataja2xp3lm" style="color: black;">Journal of Animal Ecology</a> </i> &nbsp;
The authors show that a greedy algorithm does not find networks' maximum nestedness values.  ...  Simulated annealing achieved much better results, laying the foundation for future development of even more sophisticated algorithms.  ...  F I G U R E 1 Three graphs with branching structures to illustrate the limitations of greedy algorithms. (a) A graph with a branching structure.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1111/1365-2656.12963">doi:10.1111/1365-2656.12963</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/30874298">pmid:30874298</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC6850377/">pmcid:PMC6850377</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pdhjwhpi6nhctc5c6mfgfhuxku">fatcat:pdhjwhpi6nhctc5c6mfgfhuxku</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201103110139/https://www.repository.cam.ac.uk/bitstream/handle/1810/288191/1365-2656.12963.pdf;jsessionid=D484F099A863B9E72C69889247B1038E?sequence=8" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0c/82/0c829a5b022f8b5d7d352a6d0313ddb358b13aed.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1111/1365-2656.12963"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6850377" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Optimizing software design migration from structured programming to object oriented paradigm

Saeed Siddik, Alim Ul Gias, Shah Mostafa Khaled
<span title="">2014</span> <i title="IEEE"> 16th Int&#39;l Conf. Computer and Information Technology </i> &nbsp;
To aid this problem, certain heuristic algorithms based on Monte Carlo and Greedy approaches are being developed.  ...  The numerical results show that greedy algorithms are faster and produced better results than the average performance of Monte Carlo based approaches.  ...  A mathematical formulation of the problem is presented in Section III. Section IV presents five variations of our Monte Carlo based heuristics, and three variations greedy algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iccitechn.2014.6997320">doi:10.1109/iccitechn.2014.6997320</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/z343ppd565b35lawjktjg7mobq">fatcat:z343ppd565b35lawjktjg7mobq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321113851/http://www.iit.du.ac.bd/about_iit/download/123" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f4/13/f41351d757b2e7aa491a479efbaf32168f04bf29.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iccitechn.2014.6997320"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

CPC volume 4 issue 1 Cover and Back matter

<span title="">1995</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/domxx2wewzae3e2m2ziqaqbyhm" style="color: black;">Combinatorics, probability &amp; computing</a> </i> &nbsp;
for listing combinatorial structures.  ...  It stresses common techniques (such as generating functions and recursive construction) which underlie the great variety of subject matter, and the fact that a constructive or algorithmic proof is more  ...  EDWARDS Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs 47 ALAN FRIEZE, A.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s0963548300001425">doi:10.1017/s0963548300001425</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jo6j4ir3ynfnfdjlfo2gxipuje">fatcat:jo6j4ir3ynfnfdjlfo2gxipuje</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180730090744/https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E9F3FA1FAAB43B80FAEDC09A32475358/S0963548300001425a.pdf/div-class-title-cpc-volume-4-issue-1-cover-and-back-matter-div.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2e/89/2e89b2501130f4a118d4c42afa70e317b82e6463.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s0963548300001425"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

A ranking model for the greedy algorithm and discrete convexity

Ulrich Faigle, Walter Kern, Britta Peis
<span title="2010-09-04">2010</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o653fqsowvcyrhw6p4gdmpdkwm" style="color: black;">Mathematical programming</a> </i> &nbsp;
In particular, a general model for combinatorial optimization under supermodular constraints is presented which guarantees the greedy algorithm to work.  ...  Moreover, v gives rise to a ranking and selection procedure for the elements of the ground set N and thus implies a greedy algorithm for the linear program.  ...  Choice functions underly also Fujishige's [13] model for dual greedy algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10107-010-0406-2">doi:10.1007/s10107-010-0406-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/suhadfg3ifcabjan2luphwvsyy">fatcat:suhadfg3ifcabjan2luphwvsyy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171016163909/http://publisher-connector.core.ac.uk/resourcesync/data/Springer-OA/pdf/9be/aHR0cDovL2xpbmsuc3ByaW5nZXIuY29tLzEwLjEwMDcvczEwMTA3LTAxMC0wNDA2LTIucGRm.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7e/cf/7ecfe8f8f407bbeb8a949bac23cd88f0598fc11d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10107-010-0406-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Finding and evaluating the community structure in semantic peer-to-peer overlay networks

HanHua Chen, Hai Jin
<span title="2011-06-10">2011</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ikvx2lmj7rew7jpw4lygqgjpby" style="color: black;">Science China Information Sciences</a> </i> &nbsp;
We propose a mathematical model to evaluate the property of community structure of semantic P2P overlay networks. A heuristic algorithm is designed to optimize the community structure.  ...  Recently much attention has been paid to semantic overlay networks for information retrieval in large scale peer-to-peer networks, and much research work on semantic overlay protocols and searching algorithms  ...  We propose a mathematical model to evaluate the community structure property. A heuristic backtrace-greedy hybrid algorithm is designed to optimize the evaluation value of a given overlay network.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11432-011-4296-6">doi:10.1007/s11432-011-4296-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ijjghf22onhdflfpyyxgm2xok4">fatcat:ijjghf22onhdflfpyyxgm2xok4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210801091103/https://www.sciengine.com/doi/pdf/3b2c2efb497e482b8f4a27b417b4ce4f" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/56/45/56456e80d54f6e84f69614cf67f51523d5c81457.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11432-011-4296-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 18,566 results