Filters








1,579,260 Hits in 3.6 sec

Performance Evaluation [chapter]

Robert Dochow
<span title="">2016</span> <i title="Springer Fachmedien Wiesbaden"> Online Algorithms for the Portfolio Selection Problem </i> &nbsp;
In case of EGS centers, the problem is more acute, because, no provision for cook has been made.  ...  Qualitative Notes 2.2.11 The questionnaires prepared for making field notes at different levels and observed by the Regional Evaluation Offices (REOs) and Project Evaluation Offices (PEOs) of the Programme  ...  There is a scope for convergence with schemes like National Rural Employment Guarantee Scheme for construction of kitchen sheds and honorarium of cooks cum helpers, Drinking water / toilet through Rajiv  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-658-13528-7_3">doi:10.1007/978-3-658-13528-7_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mcnoiffkpjd7tdwzqskwui4qee">fatcat:mcnoiffkpjd7tdwzqskwui4qee</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110304023737/http://planningcommission.nic.in/reports/peoreport/peoevalu/peo_cmdm.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/3d/ef/3def8b62254380c617ffaa1a3a7eaa48aa75e230.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-658-13528-7_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Evaluating Meta-Feature Selection for the Algorithm Recommendation Problem [article]

Geand Trindade Pereira, Moises Rocha dos Santos, Andre Carlos Ponce de Leon Ferreira de Carvalho
<span title="2021-06-11">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper presents an empirical analysis of Feature Selection and Feature Extraction in the meta-level for the AR problem.  ...  In this context, the problem of Algorithm Recommendation (AR) is receiving a significant deal of attention recently.  ...  Meta-learning for Algorithm Recommendation The work [12] was purposed the algorithm selection problem, as know as the algorithm recommendation problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2106.03954v2">arXiv:2106.03954v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cvuopgyiafbgxkgolrhtchheoi">fatcat:cvuopgyiafbgxkgolrhtchheoi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210621223005/https://arxiv.org/pdf/2106.03954v2.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/d7/7b/d77bbd43a98fce62dc9f007415b09fa9305d1288.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2106.03954v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Experimental Evaluation of Algorithms for the Food-Selection Problem [article]

Camil Demetrescu and Irene Finocchi and Giuseppe F. Italiano and Luigi Laura
<span title="2014-01-29">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we describe the result of our experiments on Algorithms for the Food-Selection Problem, which is the fundamental problem first stated and addressed in the seminal paper pigout.  ...  Because the key aspect of any experimental evaluation is the reproducibility, we detail deeply the setup of all our experiments, thus leaving to the interested eater the opportunity to reproduce all the  ...  In this paper we present the experimental evaluation of the algorithms for the food selection problem originally presented in [1] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1401.7591v1">arXiv:1401.7591v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ymf7alcfwneb7jfxlpd5qphoti">fatcat:ymf7alcfwneb7jfxlpd5qphoti</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191022231338/https://arxiv.org/pdf/1401.7591v1.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/41/ee/41ee075581800d6f0020e8bb633321d645dd0b92.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1401.7591v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Simulation-based Evaluation of Dynamic Vehicle Routing Problem Features for Algorithm Selection

Thomas Mayer, Tobias Uhlig, Oliver Rose
<span title="">2019</span> <i title="ARGESIM Arbeitsgemeinschaft Simulation News"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/aufybclgxbgu5f6noqos7ehygu" style="color: black;">SNE Simulation Notes Europe</a> </i> &nbsp;
Algorithm selection based on problem instance features is a common method to choose approaches for NP-hard combinatorial optimization problems.  ...  In our paper we translate known VRP features to features for the Dynamic Vehicle Routing Problem (DVRP). We investigate the suitability of them for algorithm selection.  ...  Simulation-based evaluation of DVRP Features for Algorithm Selection.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11128/sne.29.tn.10493">doi:10.11128/sne.29.tn.10493</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rdy3yurl7jdhngdxvtgumfnjfe">fatcat:rdy3yurl7jdhngdxvtgumfnjfe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200507025940/https://www.sne-journal.org/fileadmin/user_upload_sne/SNE_Issues_OA/SNE_29_4/articles/sne.29.4.10493.tn.OA.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] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11128/sne.29.tn.10493"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Multi objective optimization of computationally expensive multi-modal functions with RBF surrogates and multi-rule selection

Taimoor Akhtar, Christine A. Shoemaker
<span title="2015-02-08">2015</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dpj4kespnjdflemhwaulft4tm4" style="color: black;">Journal of Global Optimization</a> </i> &nbsp;
For example, on a groundwater PDE problem, GOMORS outperforms ParEGO with 100, 200 and 400 evaluations for a 6 dimensional problem, a 12 dimensional problem and a 24 dimensional problem.  ...  A balance between exploration, exploitation and diversification is obtained through a novel procedure that simultaneously selects evaluation points within an algorithm iteration through different metrics  ...  One single objective problem is chosen at random from the predefined set of decomposed problems and EGO is applied to it to for selection of one point for evaluation per algorithm iteration.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10898-015-0270-y">doi:10.1007/s10898-015-0270-y</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/55d5dymxzzgpxh5rgox4xczxya">fatcat:55d5dymxzzgpxh5rgox4xczxya</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170826194534/https://link.springer.com/content/pdf/10.1007%2Fs10898-015-0270-y.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/c6/92/c692720c97a4124bd42f488427f955d09f030d22.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10898-015-0270-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Active Learning to Support the Generation of Meta-examples [chapter]

Ricardo Prudêncio, Teresa Ludermir
<span title="">2007</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Hence, the need for empirical evaluations of the candidate algorithms is reduced.  ...  Experiments were performed using the classification uncertainty of the k-NN algorithm as the criteria for active selection of problems.  ...  The concepts and techniques of Meta-Learning were originally evaluated to select algorithms for classification and regression problems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-74690-4_83">doi:10.1007/978-3-540-74690-4_83</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hxfqaeyzojd7lgacai7vr4dggu">fatcat:hxfqaeyzojd7lgacai7vr4dggu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811053719/http://www.cin.ufpe.br/~rbcp/papers/ICANN07.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/72/85/7285cbb5961d8e06cf38fff70e51e4bf5274ac15.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-74690-4_83"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

An empirical study of various candidate selection and partitioning techniques in the DIRECT framework [article]

Linas Stripinis, Remigijus Paulavičius
<span title="2022-05-01">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Twelve DIRECT-type algorithmic variations are compared on 800 randomly generated GKLS-type test problems and 96 box-constrained global optimization problems from DIRECTGOLib v1.1 with varying complexity  ...  The main two steps of DIRECT-type algorithms are selecting and partitioning potentially optimal rectangles.  ...  Acknowledgment The authors greatly thank the anonymous Reviewer for his valuable and constructive comments, which helped us significantly extend and improve the manuscript.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.14912v2">arXiv:2109.14912v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/urbcjvtdi5h4paqpobv2gnkkny">fatcat:urbcjvtdi5h4paqpobv2gnkkny</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220504072955/https://arxiv.org/pdf/2109.14912v2.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/22/96/2296ead74ca16383a4df98d96b7550d55afdb1d2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.14912v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Per-run Algorithm Selection with Warm-starting using Trajectory-based Features [article]

Ana Kostovska, Anja Jankovic, Diederick Vermetten, Jacob de Nobel, Hao Wang, Tome Eftimov, Carola Doerr
<span title="2022-04-20">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Per-instance algorithm selection seeks to recommend, for a given problem instance and a given performance criterion, one or several suitable algorithms that are expected to perform well for the particular  ...  In this work, we propose an alternative, online algorithm selection scheme which we coin per-run algorithm selection.  ...  scenario, 70% of the instances from each of the 24 BBOB problems are randomly selected for training and 30% are selected for testing.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2204.09483v1">arXiv:2204.09483v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rpxh5ibl6rebdngmdz7tmz6lme">fatcat:rpxh5ibl6rebdngmdz7tmz6lme</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220429133247/https://arxiv.org/pdf/2204.09483v1.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/9a/19/9a1983d0685c03731af20b583ec6eb94d95a8908.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2204.09483v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Optimization Algorithms to Solve Feature Selection Problem: A Review

Laith Abualigah
<span title="2019-12-15">2019</span> <i title="The World Academy of Research in Science and Engineering"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fjstjkxgmjckbhc7qhzgyduxzi" style="color: black;">International Journal of Science and Applied Information Technology</a> </i> &nbsp;
The goal is to provide a general presentation to variant optimization algorithms that can be applied to a wide array of machine learning problems. We converge on Filter, Wrapper and Embedded methods.  ...  Finally, we analyzed the results of several feature selection techniques on standard datasets to illustrate the applicability of feature selection techniques.  ...  For global optimization and feature selection algorithm a novel chaotic salp swarm algorithm is practical for two problems; FS problem and global optimization problem [31] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30534/ijsait/2019/098620198">doi:10.30534/ijsait/2019/098620198</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yhu7zyofljgelb3ocaxy2kcd2a">fatcat:yhu7zyofljgelb3ocaxy2kcd2a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220311232313/http://www.warse.org/IJSAIT/static/pdf/file/ijsait09862019.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/ee/0a/ee0a08fc38ad4ba88f8415a4dbe5219e7bc9870f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30534/ijsait/2019/098620198"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms

Tinkle Chugh, Karthik Sindhya, Jussi Hakanen, Kaisa Miettinen
<span title="2017-12-11">2017</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/e5brmbb4nne2bb6o5whxervgii" style="color: black;">Soft Computing - A Fusion of Foundations, Methodologies and Applications</a> </i> &nbsp;
Evolutionary algorithms are widely used for solving multiobjective optimization problems but are often criticized because of a large number of function evaluations needed.  ...  In addition, we discuss selecting an algorithm to solve a given computationally expensive mmultiobjective optimization problem based on the dimensions in both objective and decision spaces and the computation  ...  Acknowledgments: The research of Tinkle Chugh was funded by the COMAS Doctoral Program (at the University of Jyväskylä) and FiDiPro Project DeCoMo (funded by Tekes, the Finnish Funding Agency for Innovation  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00500-017-2965-0">doi:10.1007/s00500-017-2965-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tr3v2czjfvez7j6qasxxemohme">fatcat:tr3v2czjfvez7j6qasxxemohme</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200310030739/https://ore.exeter.ac.uk/repository/bitstream/handle/10871/31730/Chugh_Survey_Expensive_Multiobjective_Optimization.pdf;jsessionid=9B6B7C6CBDD87E49EA6CF9F3384AECC4?sequence=1" 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/16/d8/16d820a048aa8ed52b27e8ac3857a36127d63541.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00500-017-2965-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Metalearning and Recommender Systems: A literature review and empirical study on the algorithm selection problem for Collaborative Filtering

Tiago Cunha, Carlos Soares, André C.P.L.F. de Carvalho
<span title="">2018</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ozlq63ehnjeqxf6cuxxn27cqra" style="color: black;">Information Sciences</a> </i> &nbsp;
The current trend to solve this problem is the experimental evaluation of several recommendation algorithms in a handful of datasets.  ...  Such studies allow to understand the relationships between data characteristics and the relative performance of recommendation algorithms, which can be used to select the best algorithm(s) for a new problem  ...  Acknowledgments This work is financed by the ERDF Fund through the Operational Program for Competitiveness and Internationalization -COMPETE 2020 of Portugal 2020 through National Innovation Agency (ANI  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ins.2017.09.050">doi:10.1016/j.ins.2017.09.050</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tu6w7bvyhfdpdacw2uy5rrobye">fatcat:tu6w7bvyhfdpdacw2uy5rrobye</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190501173742/https://repositorio.inesctec.pt/bitstream/123456789/7575/1/P-00N-1N7.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/8d/c9/8dc9aabec17aaba063eefa4e2c352d8dbf4528e0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ins.2017.09.050"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A New Evaluation Approach for Video Processing Algorithms

A.t NGHIEM, F. BREMOND, M. THONNAT, R. MA
<span title="">2007</span> <i title="IEEE"> 2007 IEEE Workshop on Motion and Video Computing (WMVC&#39;07) </i> &nbsp;
The maximum difficulty level of the videos at which the algorithm is performing good enough is defined as the upper bound of the algorithm capacity for handling the problem.  ...  To illustrate this methodology, we present metrics that evaluate the algorithm performance relatively to the problems of handling weakly contrasted objects and shadows.  ...  Acknowledgement: We would like to thank the ETISEO team (in particular SILOGIC) for providing us the ETISEO data and support to accomplish this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/wmvc.2007.2">doi:10.1109/wmvc.2007.2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m4okbwvr2rhgzivopbyjgxmdsy">fatcat:m4okbwvr2rhgzivopbyjgxmdsy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808214215/http://www-sop.inria.fr/orion/Publications/Articles/nghiem.WMVC2007.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/90/3e/903ebd73a22f3377e3c6ed28260f3f3a23b3c2c4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/wmvc.2007.2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Multiprocessor Scheduling Using Parallel Genetic Algorithm [article]

Nourah Al-Angari, Abdullatif ALAbdullatif
<span title="2012-09-24">2012</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Genetic algorithm (GA) has been successfully applied to solve the scheduling problem. The fitness evaluation is the most time consuming GA operation for the CPU time, which affect the GA performance.  ...  The proposed synchronous master-slave algorithm outperforms the sequential algorithm in case of complex and high number of generations problem.  ...  In smaller problems, it is not preferred to use the parallel algorithms. Using the asynchronies may give a better performance since it will never have to wait for all processors to finish their tasks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1209.5319v1">arXiv:1209.5319v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fhxkmnk7ynepzbeozhyhlx3a2u">fatcat:fhxkmnk7ynepzbeozhyhlx3a2u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200828062028/https://arxiv.org/ftp/arxiv/papers/1209/1209.5319.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/bb/63/bb63d53777518bc0b2568da2c477694083696855.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1209.5319v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

GreedEx: A Visualization Tool for Experimentation and Discovery Learning of Greedy Algorithms

J. Angel Velazquez-Iturbide, Ouafae Debdi, Natalia Esteban-Sanchez, Celeste Pizarro
<span title="">2013</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5vhxupybozd7plokdq7dcl2ojy" style="color: black;">IEEE Transactions on Learning Technologies</a> </i> &nbsp;
First, the GreedEx system itself is an innovative system for experimentation and discovery learning of greedy algorithms.  ...  Several years ago we presented an experimental, discovery-learning approach to the active learning of greedy algorithms.  ...  When the algorithm is executed for a particular selection function, the corresponding row is filled in. Some columns are common for any problem: . Selection function. .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tlt.2013.8">doi:10.1109/tlt.2013.8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7kqmgc5vybfijkcvtyxsobbpci">fatcat:7kqmgc5vybfijkcvtyxsobbpci</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170819234108/https://www.computer.org/csdl/trans/lt/2013/02/tlt2013020130.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/fd/e6/fde60948686c32011dc8afc42c9acc90e0e3b62e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tlt.2013.8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Surrogate-assisted evolutionary biobjective optimization for objectives with non-uniform latencies

Tinkle Chugh, Richard Allmendinger, Vesa Ojalehto, Kaisa Miettinen
<span title="">2018</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fdhfwmjdwjbvxo6zc7cdt5hi7q" style="color: black;">Proceedings of the Genetic and Evolutionary Computation Conference on - GECCO &#39;18</a> </i> &nbsp;
Moreover, reference vectors are used for the needs of diversity. For more details, see [7] . The selected samples P are then evaluated in step 2.  ...  proposed for such problems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3205455.3205514">doi:10.1145/3205455.3205514</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/gecco/ChughAOM18.html">dblp:conf/gecco/ChughAOM18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/duqbtauna5hmrhgxzzebclsiqa">fatcat:duqbtauna5hmrhgxzzebclsiqa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190428212933/https://jyx.jyu.fi/bitstream/handle/123456789/59258/gecco2018jyx.pdf;jsessionid=1EF8FE242EF4554120DE880FCF2F7BD1?sequence=1" 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/c1/f5/c1f57eea514087706c7f02a80263989f2fff4524.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3205455.3205514"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,579,260 results