564 Hits in 8.4 sec

On the size complexity of hybrid networks of evolutionary processors

Juan Castellanos, Peter Leupold, Victor Mitrana
2005 Theoretical Computer Science  
Finally, the size complexity of accepting hybrid networks of evolutionary processors recognizing all NP languages in polynomial time is briefly discussed.  ...  We also briefly present a few NP-complete problems and recall how they can be solved in linear time by accepting networks of evolutionary processors with linearly bounded resources (nodes, rules, symbols  ... 
doi:10.1016/j.tcs.2004.07.035 fatcat:ii6xljlvvbdlllwxknfnsfkqfa

Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication

Jürgen Dassow, Florin Manea
2010 Electronic Proceedings in Theoretical Computer Science  
Starting from the fact that complete Accepting Hybrid Networks of Evolutionary Processors allow much communication between the nodes and are far from network structures used in practice, we propose in  ...  For star networks or grid networks, we show a more general result; that is, each recursively enumerable language can be accepted efficiently by a star- or grid-AHNEP.  ...  Moreover, ring-AHNEPs are able to solve NP-complete problems in polynomial time.  ... 
doi:10.4204/eptcs.31.9 fatcat:u6bbojfdxrcsvf5bmswchz53t4

Hybrid Scheduling Scheme for Real Time Systems

Medhat H A Awadalla
This paper addresses the problem of energy-aware static partitioning of periodic real time tasks on heterogeneous multiprocessor platforms.  ...  An energy-aware cost function is proposed to be considered in the proposed approach.  ...  Also, one resource can execute only one job at a time and Size and number of resources are static and should be known in prior. [7] .  ... 
doi:10.24297/ijct.v15i6.1584 fatcat:v6zdc5bdjzb5vccu73a4vrj6wm

Deciding Networks of Evolutionary Processors [chapter]

Florin Manea
2011 Lecture Notes in Computer Science  
Finally, we obtain a surprising characterization of P NP [log] as the class of languages that can be decided in polynomial time by ANEPs. (A) Also at  ...  In this paper we discuss the usage of Accepting Networks of Evolutionary Processors (ANEPs for short) as deciding devices.  ...  Note, once more, that all the problems in P NP [log] can be solved by networks with the same topology, so, in a way, the solution to a problem is not based on the topology of the network but on the algorithm  ... 
doi:10.1007/978-3-642-22321-1_29 fatcat:5etmyjz7bfdt7miuhzaxbbnvsi

Complexity results for deciding Networks of Evolutionary Processors

Florin Manea
2012 Theoretical Computer Science  
Finally, focusing on the computational complexity of ANEP-based computations, we obtain a surprising characterisation of P NP[log] as the class of languages that can be decided in polynomial time by such  ...  The Accepting Networks of Evolutionary Processors (ANEPs for short) are bio-inspired computational models which were introduced and thoroughly studied in the last decade.  ...  The author's work was partially supported by the Alexander von Humboldt Foundation, through a two-years Research Fellowship at the Otto-von-Guericke University Magdeburg, Germany, that ended in June 2011  ... 
doi:10.1016/j.tcs.2012.06.029 fatcat:g53pibwuevg4vo4zymmzvl6ur4

Computability and Complexity of Unconventional Computing Devices [article]

Hajo Broersma, Susan Stepney, Goran Wendin
2017 arXiv   pre-print
We discuss some claims that certain UCOMP devices can perform hypercomputation (compute Turing-uncomputable functions) or perform super-Turing computation (solve NP-complete problems in polynomial time  ...  We discover that all these claims rely on the provision of one or more unphysical resources.  ...  Networks of Evolutionary Processors An "Accepting Hybrid Network of Evolutionary Processors" (AHNEP) is a theoretical device for exploring language-accepting processes.  ... 
arXiv:1702.02980v2 fatcat:pikmc4gtuncztofsjw6as7vetu

Efficient Task Scheduling Approach Relevant to the Hardware/Software Co-Design of Embedded System

Barbara Korou�i� Seljak
2000 Journal of Computing and Information Technology  
As hardware/software co-design of embedded systems has been enabled by advances in computer technologies, reprogrammable hardware can be used to implement a co-processor to perform most of the kernel functions  ...  In this kind of system design, more complex scheduling approaches can be applied.  ...  Acknowledgement The author gratefully acknowledges the contributions of Professor Jim E. Cooling.  ... 
doi:10.2498/cit.2000.03.03 fatcat:ldm5tasw5feqrbrvo3shbnnsq4

Accepting Networks of Genetic Processors are computationally complete

Marcelino Campos, José M. Sempere
2012 Theoretical Computer Science  
The model, Accepting Network of Genetic Processors, is highly related to previously proposed ones such as Networks of Evolutionary Processors and Networks of Splicing Processors.  ...  In addition, we relate the proposed model with (parallel) Genetic Algorithms or Evolutionary Programs and we set these techniques as decision problem solvers.  ...  Mario de Jesús Pérez Jiménez (University of Seville) for the useful comments that he made, which have improved the final version of this work.  ... 
doi:10.1016/j.tcs.2012.06.028 fatcat:qotmvwbtlbe5vj7v3d7jpbxzgi

Literature Review of Open Shop Scheduling Problems

Ellur Anand, Ramasamy Panneerselvam
2015 Intelligent Information Management  
First, the problem is classified as per different measures of performance, viz., minimization of makespan, minimization of sum of completion times of jobs, minimization of sum of weighted completion times  ...  of all jobs, minimization of total tardiness of all jobs, minimization of sum of weighted tardiness of all jobs, minimization of weighted sum of tardy jobs, and miscellaneous measures of the open shop  ...  They showed that openshop scheduling problem with preventive maintenance schedule for each machine can be solved in polynomial time. Sedeno-Noda et al.  ... 
doi:10.4236/iim.2015.71004 fatcat:shukynonjrfaleqiousjru3ari

A Grid Enabled Parallel Hybrid Genetic Algorithm for SPN [chapter]

Giuseppe Lo Presti, Giuseppe Lo Re, Pietro Storniolo, Alfonso Urso
2004 Lecture Notes in Computer Science  
Although the results achieved cannot be applied directly to the problem we investigate, they can be used to validate other methodologies that can find better applications in the telecommunication field  ...  This paper presents a combination of a parallel Genetic Algorithm (GA) and a local search methodology for the Steiner Problem in Networks (SPN).  ...  The Steiner Tree Problem in Networks Formally, the Steiner Tree Problem in Networks can be formulated as follows.  ... 
doi:10.1007/978-3-540-24685-5_20 fatcat:she64bftyrftbit2qppk4mffti

Hybrid load balance based on genetic algorithm in cloud environment

Walaa Saber, Walid Moussa, Atef M. Ghuniem, Rawya Rizk
2021 International Journal of Power Electronics and Drive Systems (IJPEDS)  
Metaheuristic techniques are powerful techniques for solving the load balancing problems. However, these techniques suffer from efficiency degradation in large scale problems.  ...  This paper proposes three main contributions to solve this load balancing problem.  ...  polynomial-time (NP) complete problems.  ... 
doi:10.11591/ijece.v11i3.pp2477-2489 fatcat:o3lyuw2zfrfsfdre3byjdxfyoq

Investigations on Natural Computing in the Institute of Mathematics and Computer Science

Artiom Alhazov, Elena Boian, Liudmila Burtseva, Constantin Ciubotaru, Svetlana Cojocaru, Alexandru Colesnicov, Valentina Demidova, Sergiu Ivanov, Veaceslav Macari, Galina Magariu, Ludmila Malahova, Vladimir Rogojin (+4 others)
2010 Computer Science Journal of Moldova  
We describe the investigations on natural computing in the Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova during last fifteen years.  ...  Most of these investigations are inspired by results and ideas belonging to Corresponding Member of the Romanian Academy Gheorghe Paun.  ...  Acknowledgments All authors acknowledge the support by the Science and Technology Center in Ukraine, project 4032.  ... 
doaj:4a41c2dcf8c14619bd127cda0ee90e72 fatcat:oytiwwjjlzdabc7om5h7mkatla

Further Research on Node Based Bottleneck Improvement Problem for Multicut [chapter]

Xiucui Guan, Jie Su
2006 Lecture Notes in Computer Science  
Topics of interest are found in all fields of combinatorial optimization, e.g. logistics, production, scheduling, resource and operations management, flexible manufacturing, VLSI design, network design  ...  Theme: ECCO is the annual meeting of the EURO working group on combinatorial optimization. ECCO was started in 1987 by a group of leading experts in Operations Research and Management Science.  ...  Generalisations of this problem have been introduced, taking into account fault tolerance considerations or capacity constraints. We propose a general framework to formulate and solve these problems.  ... 
doi:10.1007/11816157_107 fatcat:xjdnf4kesrbczoh4ilvxxixqei

Self-Organizing and Self-Evolving Neurons: A New Neural Network for Optimization

Sitao Wu, Tommy W. S. Chow
2007 IEEE Transactions on Neural Networks  
At last, the computational time of parallel SOSENs can be less than the SA.  ...  Optimum results obtained by the SOSENs are better in average than those obtained by a single SA.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers' useful suggestions that greatly improved the format of this paper.  ... 
doi:10.1109/tnn.2006.887556 pmid:17385627 fatcat:gdmalk6bqfe5vk7vhw4kmtfmdi

Quantum Annealing for Industry Applications: Introduction and Review [article]

Sheir Yarkoni, Elena Raponi, Sebastian Schmitt, Thomas Bäck
2021 arXiv   pre-print
Quantum annealing is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems.  ...  Specifically, quantum annealing processors produced by D-Wave Systems have been studied and tested extensively in both research and industrial settings across different disciplines.  ...  This work is part of the research programme C2D-Horizontal Data Science for Evolving Content with project name DACCOMPLI and project number 628.011.002, which is (partly) financed by the Netherlands Organisation  ... 
arXiv:2112.07491v2 fatcat:3dw6zkobtfejvdmdgqcjrv3jmq
« Previous Showing results 1 — 15 out of 564 results