Filters








16,559 Hits in 4.8 sec

Better GP benchmarks: community survey results and proposals

David R. White, James McDermott, Mauro Castelli, Luca Manzoni, Brian W. Goldman, Gabriel Kronberger, Wojciech Jaśkowski, Una-May O'Reilly, Sean Luke
2012 Genetic Programming and Evolvable Machines  
We present the results of a community survey regarding genetic programming (GP) benchmark practices.  ...  While views expressed in the survey dissuade us from proposing a large-scale benchmark suite, we find community support for creating a "blacklist" of problems which are in common use but have important  ...  for her advice on survey design, and to the School itself for providing the supporting web service.  ... 
doi:10.1007/s10710-012-9177-2 fatcat:hlusjunk7ferfahx4rk5mpgz5i

A Novel Local Search-Based Approximation Algorithm to Optimize Virtual Machine Placement With Resource Constraints

Darshan Maheshbhai Shah, M. Vinayaka Murthi, Anand Kumar, K.S. Chun, C.H. Leng, F.W.Y. Myan, P.S. King, N. Zaman
2021 MATEC Web of Conferences  
A new proposed algorithm is empirically evaluated with state-of-the-art techniques. and our algorithm has improved placement result by 18% in CPU utilization, 21% in resource contention and 26% in overall  ...  resource utilization for benchmark instances collected from azure private cloud data center.  ...  A detailed workflow is mentioned in the following section and we have fully considered this workflow in the design of our new algorithm for integration, stability and easy maintenance.  ... 
doi:10.1051/matecconf/202133504007 fatcat:fciwxbpwgvgfnfxqr335py6pwa

Predicting Formal Verification Resource Needs (Computation Time and Memory) through Machine Learning

Jason Twigg, Erik Torkelson, Nazanin Mansouri
2021 Journal of student research  
In this work, a neural network is used to predict the formal verification cost for a diverse collection of designs. Experiments with a large variety of Verilog benchmarks have been conducted.  ...  In each experiment, the specific features of a given design are extracted, the design is synthesized and formally verified, and the verification time and memory usage are recorded.  ...  A collection of Verilog benchmarks is synthesized and corresponding netlists are generated for each design.  ... 
doi:10.47611/jsr.v10i4.1443 fatcat:jetpmwg7xvdg7jry43kzt4j7xu

Instruction-set architecture exploration of VLIW ASIPs using a genetic algorithm

Roel Jordans, Lech Jozwiak, Henk Corporaal
2014 2014 3rd Mediterranean Conference on Embedded Computing (MECO)  
However, the exploration time for problems with huge design spaces can be very long, often making exploration using a genetic algorithm practically infeasible.  ...  Genetic algorithms are commonly used for automatically solving complex design problem because exploration using genetic algorithms can consistently deliver good results when the algorithm is given a long  ...  However, further tuning of the genetic algorithms parameters (e.g. population size, mutation rate) is possible and is planned for future work.  ... 
doi:10.1109/meco.2014.6862720 fatcat:tw7c6pn2kzffrndoukf7kzax7q

A Metaheuristic Algorithm for VLSI Floorplanning Problem

2019 International journal of recent technology and engineering  
It's a necessary design step to estimate the chip area before the optimized placement of digital blocks and their interconnections.  ...  The experimental results of the HGA algorithm are obtained for the MCNC benchmark circuits  ...  Genetic algorithms are anything but difficult to execute in programming and equipment. They can likewise be effectively adjusted to a wide assortment of problems.  ... 
doi:10.35940/ijrte.b1052.0782s519 fatcat:d4qb44jds5c3bdvwgattvi4veq

A black-box discrete optimization benchmarking (BB-DOB) pipeline survey

Aleš Zamuda, Miguel Nicolau, Christine Zarges
2018 Proceedings of the Genetic and Evolutionary Computation Conference Companion on - GECCO '18  
This paper provides a taxonomical identification survey of classes in discrete optimization challenges that can be found in the literature including a proposed pipeline for benchmarking, inspired by previous  ...  Thereby, a Black-Box Discrete Optimization Benchmarking (BB-DOB) perspective is presented for the BB-DOB@GECCO Workshop.  ...  Modelling and Simulation for Big Data Applications (cHiPSet)' supported by COST (European Cooperation in Science and Technology).  ... 
doi:10.1145/3205651.3208307 dblp:conf/gecco/ZamudaNZ18 fatcat:4olviuc3svflhjg5k2rswzwoqm

Multicriteria Energy Efficient Source Code Compilation for Dependable Embedded Applications

Naeem Azeemi
2006 2006 Innovations in Information Technology  
We present results for 10 widely used multimedia applications, and analyze their behavior for parallelism, live CPU register usage, anticipated scheduling, CPU bus activity, processing units utilization  ...  The optimization search engine is powered by genetic algorithm.  ...  The fitness function of a genetic algorithm represents the objective function of the underlying optimization problem and thus has an essential impact on the optimization progress of the genetic algorithm  ... 
doi:10.1109/innovations.2006.301963 fatcat:hz3nklxiofbkbdksx6pvvjax6u

Choose Your Programming Copilot: A Comparison of the Program Synthesis Performance of GitHub Copilot and Genetic Programming [article]

Dominik Sobania, Martin Briesch, Franz Rothlauf
2021 arXiv   pre-print
Genetic programming usually needs a huge amount of expensive hand-labeled training cases and takes too much time to generate solutions.  ...  In this paper, we evaluate GitHub Copilot on standard program synthesis benchmark problems and compare the achieved results with those from the genetic programming literature.  ...  ACKNOWLEDGMENTS The authors would like to thank the GitHub Copilot extension for Visual Studio Code for the helpful discussions on our experimental source code.  ... 
arXiv:2111.07875v1 fatcat:stxzpmcmo5fsnckidpnmxub2cm

Choose your programming copilot

Dominik Sobania, Martin Briesch, Franz Rothlauf
2022 Proceedings of the Genetic and Evolutionary Computation Conference  
Genetic programming usually needs a huge amount of expensive hand-labeled training cases and takes too much time to generate solutions.  ...  In this paper, we evaluate GitHub Copilot on standard program synthesis benchmark problems and compare the achieved results with those from the genetic programming literature.  ...  ACKNOWLEDGMENTS The authors would like to thank the GitHub Copilot extension for Visual Studio Code for the helpful discussions on our experimental source code.  ... 
doi:10.1145/3512290.3528700 fatcat:zsxwmjlgxfegdkyr6x2dpvt6um

A Benchmark for Multi-UAV Task Assignment of an Extended Team Orienteering Problem [article]

Kun Xiao, Junqi Lu, Ying Nie, Lan Ma, Xiangke Wang, Guohui Wang
2020 arXiv   pre-print
A benchmark for multi-UAV task assignment is presented in order to evaluate different algorithms. An extended Team Orienteering Problem is modeled for a kind of multi-UAV task assignment problem.  ...  The modeled problem and the evaluation results constitute a benchmark, which can be used to evaluate other algorithms used for multi-UAV task assignment problems.  ...  The extended TOP is suitable for a wide range of multi-UAV task assignment problems, such as reconnaissance and transportation. Therefore, it can be a benchmark to evaluate different algorithm.  ... 
arXiv:2009.00363v1 fatcat:g5bqhg43vnfm7d6sut4d3i6ygi

Application of Evolutionary Algorithms in Project Management [chapter]

Christos Kyriklidis, Georgios Dounias
2014 IFIP Advances in Information and Communication Technology  
In this paper, a new genetic algorithm is proposed for the investigation of the start time of the non-critical activities of a project, in order to optimally allocate its resources.  ...  The problems of this kind refer to the optimal handling of available resources in a candidate project and have emerged, as the result of the even increasing needs of project managers in facing project  ...  usage for the project) 2. min RLI (difference between actual and desirable resource usage) 3. min StD (minimization of the standard deviation) 4. min Step (minimization of uniform resource use from period  ... 
doi:10.1007/978-3-662-44654-6_33 fatcat:7j6sfhfsdrfrfcixiyumzkg6di

A Hybrid Engine for the Placement of Domain-Specific Reconfigurable Arrays

Wing On Fung, T. Arslan, S. Khawam
2007 Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)  
The adaptation of CAD design tool is essential for the development of these arrays.  ...  It reviews the difficulties encountered implementing genetic algorithm based placement in a previous attempt and presents a hybrid approach by combining genetic algorithm and simulated annealing.  ...  The automatic generation of such arrays is relatively new and the paper aims to investigate a hybrid genetic approach for this placement problem.  ... 
doi:10.1109/ahs.2007.5 dblp:conf/ahs/FungAK07 fatcat:auhor7sb6jgxdbx3udvuvrt7ye

Code building genetic programming

Edward Pantridge, Lee Spector
2020 Proceedings of the 2020 Genetic and Evolutionary Computation Conference  
Research and development of contemporary program synthesis methods, such as PushGP and Grammar Guided Genetic Programming, can produce programs that solve problems typically assigned in introductory academic  ...  These problems focus on a narrow, predetermined set of simple data structures, basic control flow patterns, and primitive, non-overlapping data types (without, for example, inheritance or composite types  ...  ACKNOWLEDGMENTS We thank Bill Tozier, Nicholas McPhee, and the members of the Hampshire College Institute for Computational Intelligence for discussions that advanced this work.  ... 
doi:10.1145/3377930.3390239 dblp:conf/gecco/PantridgeS20 fatcat:ev2o5445qbftrfo67yd73ygy7e

COSMO: A dynamic programming algorithm for multicriteria codon optimization

Akito Taneda, Kiyoshi Asai
2020 Computational and Structural Biotechnology Journal  
In addition to the benchmarking of COSMO, a multi-objective genetic algorithm (MOGA) for CDS design was also benchmarked for the same two aspects and their performances were compared.  ...  We benchmarked COSMO for run-time and the number of generated solutions by adapting selected human genes to yeast codon usage frequencies, and found that the constraints effectively reduce the run-time  ...  This research was partially supported by the Project Focused on Developing Key Technology for Discovering and Manufacturing Drugs for Next-Generation Treatment and Diagnosis from the Japan Agency for Medical  ... 
doi:10.1016/j.csbj.2020.06.035 pmid:32695273 pmcid:PMC7358382 fatcat:5n4puxao7ne4zbrn6blu6rhumm

Parallel Genetic Algorithm on the CUDA Architecture [chapter]

Petr Pospichal, Jiri Jaros, Josef Schwarz
2010 Lecture Notes in Computer Science  
This clearly shows that GPUs have a potential for acceleration of GAs and allow to solve much complex tasks.  ...  The proposed mapping is tested using Rosenbrock's, Griewank's and Michalewicz's benchmark functions.  ...  The consecutive process of replacement forms a new population for the next generation.  ... 
doi:10.1007/978-3-642-12239-2_46 fatcat:yzmzubhj5zho7eipln7g3mtsk4
« Previous Showing results 1 — 15 out of 16,559 results