13 Hits in 2.9 sec

Acceleration of Genetic Algorithms for Sudoku Solution on Many-Core Processors [chapter]

Yuji Sato, Naohiro Hasegawa, Mikiko Sato
2013 Natural Computing Series  
The genetic manipulation is also accelerated by the parallel processing of threads.  ...  To increase accuracy, we propose a genetic operation that takes building-block linkage into account.  ...  Improved Accuracy in Sudoku Solution Using Genetic Operation that Takes Linkage into Account Genetic Operations That Takes Linkage into Account A number of studies on application of GA to solving Sudoku  ... 
doi:10.1007/978-3-642-37959-8_19 fatcat:czz75owyq5bpzbrnefgteg36fm

Parallelization of genetic operations that takes building-block linkage into account

Yuji Sato, Hazuki Inoue, Mikiko Sato
2012 Artificial Life and Robotics  
Previously, we used the problem of solving Sudoku puzzles to demonstrate the possibility of shortening processing times through the use of many-core processors for genetic computations.  ...  Increasing GPU resources will diminish the conflicts with thread usage in coarse-grained parallelization of individuals and will enable faster processing.  ...  IMPROVING ACCURACY IN SUDOKU USING GENETIC OPERATION THAT TAKES LINKAGE INTO ACCOUNT IDENTIFYING BUILDING-BLOCK LINKAGE THROUGH THE CONSTRAINTS GAs are generally useful for solving problems with a  ... 
doi:10.1007/s10015-012-0012-x fatcat:22h4ch77hbfl3ejwj5ux5ndsxe


Umbarkar A.J., Joshi M.S., Rothe N.M.
2013 ICTACT Journal on Soft Computing  
Genetic Algorithm (GA) is effective and robust method for solving many optimization problems. However, it may take more runs (iterations) and time to get optimal solution.  ...  The execution time to find the optimal solution also depends upon the niching-technique applied to evolving population.  ...  Sato, Hasegawa and Sato (2011) [20] observed that a practical solution can be obtained for Sudoku using GA on GPU within few seconds of processing time with a correct solution rate of 100%, even for  ... 
doi:10.21917/ijsc.2013.0074 fatcat:o33o3fo2ujfuvk6d4x2j3ru47a

Memristive oscillatory circuits for resolution of NP-complete logic puzzles: Sudoku case [article]

Theodoros Panagiotis Chatzinikolaou, Iosif-Angelos Fyrigos, Rafailia-Eleni Karamani, Vasileios Ntinas, Giorgos Dimitrakopoulos, Sorin Cotofana, Georgios Ch. Sirakoulis
2020 arXiv   pre-print
In this paper, a memristive circuit exploiting the dynamics of oscillating networks is utilized for the resolution of very popular and NP-complete logic puzzles, like the well-known "Sudoku".  ...  efficient manner, offering viable solutions oftenly arriving also from the biological principles of living organisms.  ...  Alongside to those algorithms, the highly parallel processing capabilities of hardware accelerators, such Graphics Processing Units (GPUs), have been exploited for further reduction of the required solution  ... 
arXiv:2002.06339v1 fatcat:rmm6so4xivch3jjfizlpztq7re

Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems

Gabriel A. Fonseca Guerra, Steve B. Furber
2017 Frontiers in Neuroscience  
We demonstrate the basic principles of the framework by solving difficult instances of the Sudoku puzzle and of the map color problem, and explore its application to spin glasses.  ...  However, CSPs belong to the NP-complete complexity class, for which the existence (or not) of efficient algorithms remains a major unsolved question in computational complexity theory.  ...  ACKNOWLEDGMENTS The authors would like to thank Andrew Rowley for helpful discussions as well as Michael Hopkins and Mantas Mikaitis for proof reading and valuable suggestions to the manuscript.  ... 
doi:10.3389/fnins.2017.00714 pmid:29311791 pmcid:PMC5742150 fatcat:2iiiwhnxnffapon2aswaju27we

Development of object state estimation method in intelligent decision support systems

Vitalii Bezuhlyi, Volodymyr Oliynyk, Іgor Romanenko, Oleksandr Zhuk, Vasyl Kuzavkov, Oleh Borysov, Serhii Korobchenko, Eduard Ostapchuk, Taras Davydenko, Andrii Shyshatskyi
2021 Eastern-European Journal of Enterprise Technologies  
The advanced genetic algorithm is used when constructing a fuzzy cognitive model and increases the efficiency of identifying factors and relationships between them by simultaneously finding a solution  ...  The key difference of the developed method is the use of an advanced genetic algorithm.  ...  A Parallel Genetic Algorithm With Dispersion Correction for HW/SW Partitioning on Multi-Core CPU and Many-Core GPU.  ... 
doi:10.15587/1729-4061.2021.239854 fatcat:grjh6y4z6rhevozcjircancduu

Multi-grid cellular genetic algorithm for optimizing variable ordering of ROBDDs

Cristian Rotaru, Octav Brudaru
2012 2012 IEEE Congress on Evolutionary Computation  
The exchange of genetic material proves to considerably boost the quality of the solution.  ...  This paper presents a cellular genetic algorithm for optimizing the variable order in Reduced Ordered Binary Decision Diagrams. The evolution process is inspired by a basic genetic algorithm.  ...  The Continuous Strict Archimedean Case 334, Hyun seung Son, Jin Bae Park and Young Hoon Joo, Tracking Algorithm Compensating Acceleration for 3D Maneuvering Target with PSO-FCM 337, Fu-Hsaing Chi, Chih-Li  ... 
doi:10.1109/cec.2012.6256590 dblp:conf/cec/RotaruB12 fatcat:4ly3nrktw5habc6lf5err7d5py

Artificial Intelligence [article]

John Paul Mueller Luca Massaron
2018 Zenodo  
An example of a FPGA solution is Microsoft's Brainwave, which is used for deep-learning projects (see for  ...  However, what really sets a GPU apart is that a GPU typically contains hundreds of cores (see for details), contrasted with just a few cores for  ...  Russ is always providing me with great URLs for new products and ideas. He's also the sanity check for my work.  ... 
doi:10.5281/zenodo.5599660 fatcat:rn6nyx5xinehzpwfy3knurtzgy

Chang_columbia_0054D_16362.pdf [article]

Chapters 2 and 3 describe novel mechanisms for generating neural network weights and embeddings.  ...  Chapters 4 and 5 identify problems and propose solutions to fix optimization difficulties in differentiable mechanisms of neural network generation known as Hypernetworks.  ...  I also wish to thank the following people for their contribution to the papers that we submitted during the course of my PhD: Siyuan Chen, Robert Kwiatkowski, Yuling Yao, David  ... 
doi:10.7916/d8-3h0h-0c27 fatcat:gngf2rn365d4he4eylyo2gpape

"May the wind under your wings bear you where the sun sails and the moon walks" Many-core Algorithms for Combinatorial Optimization

J Tolkien, Francesco Strappaveccia
For each of these problems we propose a collection of effective parallel solution algorithms, either for solving the full problem (Guillotine Cuts and SSSPP) or for enhancing a fundamental part of the  ...  solution method (VRP and ND).  ...  The access to Global Memory is a significant bottleneck for performance enhancement in the design of a GPU-accelerated application.  ... 

Functional Representation of Prototypes in LVQ and Relevance Learning [chapter]

Friedrich Melchert, Udo Seiffert, Michael Biehl
2016 Advances in Intelligent Systems and Computing  
The overall acceptance rate was 88% (63% for regular papers, 100% for compressed contributions and demonstration abstracts, and 91% for thesis abstracts).  ...  van Harmelen (Vrije Universiteit Amsterdam), Hado van Hasselt (Google DeepMind), and Manuela Veloso (Carnegie Mellon University), a Research meets Business session, a panel discussion on Social Robots, with  ...  This work was realized with the support from CNPq, National Council for Scientific and Technological Development -Brazil, through a scholarship which reference number is 235134/2014-7.  ... 
doi:10.1007/978-3-319-28518-4_28 fatcat:uwxvq6txmrba3ajulmblafgh2a

Constraint Programming-based Job Dispatching for Modern HPC Applications

Cristian Alejandro Galleguillos Miccono
waiting times and job slowdowns, especially for workloads dominated by short jobs. ii iv List of Tables 2.1 Frequency and average duration of all jobs and the three classes CPU-based, MIC-based and GPU-based  ...  Heuristic techniques have been broadly used in HPC systems, at the cost of achieving (sub-)optimal solutions in a short time.  ...  The first 32 nodes were configured with 16 cores, 2 GPU accelerator cards, and 16 GB of memory each one, instead the other half has 2 MIC accelerator cards instead of the GPU ones.  ... 
doi:10.6092/unibo/amsdottorato/9497 fatcat:rwq6ihwqe5hnhkir7wefgpv6w4

Actes JFPC 2016 ComitéComit´Comité de programme Rapporteurs Additionnels

Steven Gay, Jean Marie, Lagniez Cril, Université, ' Artois, Frederic Lardeux, Nadjib Lazaar, Jean-Noël Monette, Anastasia Paparrizou, Stephanie Roussel, Philippe Vismara, Supagro Wahbi (+9 others)
Abstract The article deals with the weather routing problem for cargo ships, which involves optimizing the ship's route with real-time weather informations.  ...  This is in particular true for constraintbased solvers dealing with combinatorial optimization problems.  ...  MiniZinc with Applications to Geometrical Placement Problems » [3] .  ...