Filters








40 Hits in 10.4 sec

Runtime analysis of the (mu+1)-EA on the Dynamic BinVal function [article]

Johannes Lengler, Simone Riedi
2021 arXiv   pre-print
For the (1+1)-EA it was known that there is an efficiency threshold c_0 for the mutation parameter, at which the runtime switches from quasilinear to exponential.  ...  We prove that this is at least the case in an ε-neighborhood around the optimum: the threshold of the (μ+1)-EA becomes arbitrarily large if the μ is chosen large enough.  ...  The (1 + 1)-EA, or "(1 + 1) Evolutionary Algorithm", is a simple hillclimbing algorithm for maximizing a pseudo-Boolean function f : {0, 1} n → R.  ... 
arXiv:2010.13428v2 fatcat:vtietb2hcjdl3dqnmubrgy3sjy

Improvements to combinational equivalence checking

Alan Mishchenko, Satrajit Chatterjee, Robert Brayton, Niklas Een
2006 Computer-Aided Design (ICCAD), IEEE International Conference on  
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT).  ...  State-of-the-art methods use simulation and BDD/SAT sweeping on the input side (i.e. proving equivalence of some internal nodes in a topological order), interleaved with attempts to run SAT on the output  ...  The authors acknowledge Tim Cheng and Feng Lu from UC Santa Barbara for their help in running the experiments using CSAT reported in Table 3 , and Ganapathy Parthasarathy from Real Intent for helpful  ... 
doi:10.1145/1233501.1233679 dblp:conf/iccad/MishchenkoCBE06 fatcat:6y5cydbginfw5b7yepxoywobi4

Improvements to Combinational Equivalence Checking

Alan Mishchenko, Satrajit Chatterjee, Robert Brayton, Niklas Een
2006 Computer-Aided Design (ICCAD), IEEE International Conference on  
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT).  ...  State-of-the-art methods use simulation and BDD/SAT sweeping on the input side (i.e. proving equivalence of some internal nodes in a topological order), interleaved with attempts to run SAT on the output  ...  The authors acknowledge Tim Cheng and Feng Lu from UC Santa Barbara for their help in running the experiments using CSAT reported in Table 3 , and Ganapathy Parthasarathy from Real Intent for helpful  ... 
doi:10.1109/iccad.2006.320087 fatcat:qf323sofv5cv7facaw2gvcl7vm

Benchmarking a (μ+λ) Genetic Algorithm with Configurable Crossover Probability [article]

Furong Ye and Hao Wang and Carola Doerr and Thomas Bäck
2020 arXiv   pre-print
Our comparison on 25 pseudo-Boolean optimization problems reveals an advantage of crossover-based configurations on several easy optimization tasks, whereas the picture for more complex optimization problems  ...  At the same time, it decreases with increasing problem dimension, indicating that the advantages of the crossover are not visible in the asymptotic view classically applied in runtime analysis.  ...  Our work was supported by the Chinese scholarship council (CSC No. 201706310143), by the Paris Ile-de-France Region, and by COST Action CA15140.  ... 
arXiv:2006.05889v1 fatcat:zfeb6tkjffgvbla33qdogr72zi

Adaptation and Self-Organization in Evolutionary Algorithms [article]

James M Whitacre
2009 arXiv   pre-print
This thesis addresses several topics related to adaptation and self-organization in evolving systems with the overall aims of improving the performance of Evolutionary Algorithms (EA), understanding its  ...  Abbreviated Abstract: The objective of Evolutionary Computation is to solve practical problems (e.g. optimization, data mining) by simulating the mechanisms of natural evolution.  ...  His critical eye in the earlier drafts of this thesis helped to greatly strengthen the final version.  ... 
arXiv:0907.0516v1 fatcat:poztzewnofcfljw6bjquysz3d4

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
Finally I report numerical results of a comparison between the variant and a minimization approach using penalty functions.  ...  to the well known serious steps und null steps of bundle methods a third type of steps is used to generate the model of dom .  ...  f 0 ; 1 g be a monotone Boolean function de ned on the subsets of a nite set N.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa

Multiprocessor Systems [chapter]

John English
2005 Introduction to Operating Systems  
One trend is the increasing density and number of transistors that can be placed on a chip.  ...  This allows designers to fit more functionality into smaller devices, and to place multiple processing cores on a single chip. Another trend is the increasing emphasis on low power designs.  ...  I would also like to acknowledge the support of the Army Research Laboratory, and to thank Dr. Paul Amirtharaj and Dr. Joe Mait for their encouragement.  ... 
doi:10.1007/978-0-230-37408-9_9 fatcat:32xrcjodhjgddawaxtl5lrcxi4

A Tight Runtime Analysis for the cGA on Jump Functions---EDAs Can Cross Fitness Valleys at No Extra Cost [article]

Benjamin Doerr
2019 pre-print
function with jump size $k < \frac 1 {20} \ln n$ in $O(\mu \sqrt n)$ iterations.  ...  Our runtime guarantee improves over the recent upper bound $O(\mu n^{1.5} \log n)$ valid for $\mu = \Omega(n^{3.5+\varepsilon})$ of Hasen\"ohrl and Sutton (GECCO 2018).  ...  pseudo-Boolean functions F : {0, 1} n → R.  ... 
doi:10.1145/3321707.3321747 arXiv:1903.10983v1 fatcat:yaplaw7r2vdjhnsbor3ylxfa7e

Les Houches 2017: Physics at TeV Colliders New Physics Working Group Report [article]

G. Brooijmans, M. Dolan, S. Gori, F. Maltoni, M. McCullough, P. Musella, L. Perrozzi, P. Richardson, F. Riva, A. Angelescu, S. Banerjee, D. Barducci (+67 others)
2018 arXiv   pre-print
Our report includes new physics studies connected with the Higgs boson and its properties, direct search strategies, reinterpretation of the LHC results in the building of viable models and new computational  ...  We present the activities of the 'New Physics' working group for the 'Physics at TeV Colliders' workshop (Les Houches, France, 5--23 June, 2017).  ...  WP is supported by the DFG, project nr. PO 1337-7/1.  ... 
arXiv:1803.10379v1 fatcat:to4tbt42wzbldmyvioxgm2yw7q

Theory of Evolutionary Algorithms Dagstuhl Seminar

Dirk Arnold, Anne Auger, Carsten Witt, Jonathan Rowe
unpublished
From Jan. 27, 2008 to Feb. 1, 2008, the Dagstuhl Seminar 08051 Theory of Evolutionary Algorithms was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.  ...  Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper.  ...  A detailed analysis for the function Onemax shows that the 1-PSO is competitive to EAs.  ... 
fatcat:hvceabjognctdar22wmyfggfmy

Symmetry, Almost

Amanda Folsom
2019 Notices of the American Mathematical Society  
The AMS is not responsible for rate changes or for the quality of the accommodations. Hotels have varying cancellation and early checkout penalties; be sure to ask for details.  ...  Accommodations Participants should make their own arrangements directly with the hotel of their choice. Special discounted rates were negotiated with the hotels listed below.  ...  We mention here the generalized Boolean functions, defined on 2 (or 2 ) with values in integers modulo ≥ 2, or -ary Boolean functions, that is, functions defined on with values in , where is a prime number  ... 
doi:10.1090/noti1775 fatcat:xwrijzvqazg7bdym7un5qq2jjq

Tenth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools Aarhus, Denmark, October 19-21, 2009

Kurt Jensen
2009 DAIMI Report Series  
This booklet contains the proceedings of the Tenth Workshop on Practical Use of Coloured Petri Nets and the CPN Tools, October 19-21, 2009.  ...  The workshop is organised by the CPN group at the Department of Computer Science, University of Aarhus, Denmark.  ...  Jonathan Billington for providing valuable comments on preliminary versions of this paper.  ... 
doi:10.7146/dpb.v38i590.7187 fatcat:t5yh5d4v7jbjjj7wghs2ba6ida

Introduction [chapter]

2016 Music Data Analysis  
The interface between the computer and statistical sciences is increasing, as each discipline seeks to harness the power and resources of the other.  ...  This series aims to foster the integration between the computer sciences and statistical, numerical, and probabilistic methods by publishing a broad range of reference works, textbooks, and handbooks.  ...  The simple model consists of only two channels, one for low frequencies below 1 kHz and one for frequencies above 1 kHz.  ... 
doi:10.1201/9781315370996-5 fatcat:avooqogcpnbjngqmzuonil3exq

From Finite to Infinite: Scalable Automatic Verification of Hardware Designs and Distributed Protocols [article]

Aman Goel, University, My
2022
Our hardware verifier, called AVR, won the prestigious Hardware Model Checking Competition 2020, outperforming state-of-the-art verifiers with a wide margin, and showed large benefits on a variety of challenging  ...  Recognizing the lack of automation in verifying distributed protocols, we developed IC3PO, a new verifier that significantly outperforms the state-of-the-art by taking advantage of three structural features  ...  A.1 IC3PO Pseudo Code This section presents the detailed pseudo code of IC3PO and SymIC3. Algorithm 7 IC3 for Proving Protocol Properties Algorithm 7 presents the detailed pseudo code of IC3PO.  ... 
doi:10.7302/3867 fatcat:hzk7sbyxr5c2zhsl56r2q2qzgq

Dynamic storage allocation: A survey and critical review [chapter]

Paul R. Wilson, Mark S. Johnstone, Michael Neely, David Boles
1995 Lecture Notes in Computer Science  
We t h e n chronologically survey most of the literature on allocators between 1961 and 1995. (Scores of papers are discussed, in varying detail, and over 150 references are given.)  ...  We argue that allocator designs have b e e n unduly restricted by an emphasis on mechanism, rather than policy, while the latter is more important higher-level strategic issues are still more important  ...  Acknowledgements We w ould like to thank Hans Boehm and especially Henry Baker for many enlightening discussions of memory management o ver the last few years, and for comments on earlier versions of this  ... 
doi:10.1007/3-540-60368-9_19 fatcat:vaq2b3gacfctzgwfpdjlblszvm
« Previous Showing results 1 — 15 out of 40 results