http://www.bibsonomy.org/burst/tag/aBibSonomy BuRST Feed for /tag/a2008-07-21T00:34:36+02:00http://www.bibsonomy.org/bibtex/252d02d7c29e80cc9b283df0c51b731a5/au7334au73342008-07-01T22:35:37+02:00A <span style="color:#555555;">Josep-Manel <a href="http://www.bibsonomy.org/author/Rodriguez-Gairin">Rodriguez-Gairin</a> and Andreu Sul&#195;&#169; <a href="http://www.bibsonomy.org/author/Duesa">Duesa</a> and Patricia Russo <a href="http://www.bibsonomy.org/author/Gallo">Gallo</a> </span>(<em>2008</em>) <em>citeulike; ID: 24266 . </em>Tue Jul 01 22:35:37 CEST 2008citeulike; ID: 24266E-LIS - A Virtual Exhibition of Open Source Software for Libraries2008A http://www.bibsonomy.org/bibtex/2256df0aa2100be3f639f46680e2473f6/brazovayeyebrazovayeye2008-06-19T17:46:40+02:00factorial, reversing combinators, genetic experimentation, parity, programming list, push, languages, programming, recursion, Fibonacci sorting, stack-based a sequence, algorithms, exponentiation, iteration, <span style="color:#555555;">Lee <a href="http://www.bibsonomy.org/author/Spector">Spector</a> and Jon <a href="http://www.bibsonomy.org/author/Klein">Klein</a> and Maarten <a href="http://www.bibsonomy.org/author/Keijzer">Keijzer</a> </span><em>GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, </em><em>2, </em><em>page1689--1696. </em><em>Washington DC, USA, </em><em>ACM Press, </em><em>25-29 June2005. </em>Thu Jun 19 17:46:40 CEST 2008Washington DC, USA{GECCO 2005}: Proceedings of the 2005 conference on Genetic and evolutionary computation25-29 June1689--1696The Push3 execution stack and the evolution of control22005factorial, reversing combinators, genetic experimentation, parity, programming list, push, languages, programming, recursion, Fibonacci sorting, stack-based a sequence, algorithms, exponentiation, iteration, One of Push's attractive features in this context is its transparent support for the expression and evolution of modular architectures and complex control structures, achieved through explicit code self-manipulation. The latest version of Push, Push3, enhances this feature by permitting explicit manipulation of an execution stack that contains the expressions that are queued for execution in the interpreter. presents a series of examples in which Push3 was used with a simple genetic programming system (PushGP) to evolve programs with non-trivial control structures.http://www.bibsonomy.org/bibtex/2eb15428963876ba8c5842f2e22cce64d/brazovayeyebrazovayeye2008-06-19T17:46:40+02:00a Fibonacci programming, genetic factorial, list sequence, automatic based graph algorithms, exponentiation, reversing <span style="color:#555555;">Shinichi <a href="http://www.bibsonomy.org/author/Shirakawa">Shirakawa</a> and Shintaro <a href="http://www.bibsonomy.org/author/Ogino">Ogino</a> and Tomoharu <a href="http://www.bibsonomy.org/author/Nagao">Nagao</a> </span><em>GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, </em><em>2, </em><em>page1686--1693. </em><em>London, </em><em>ACM Press, </em><em>7-11 July2007. </em>Thu Jun 19 17:46:40 CEST 2008LondonGECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation7-11 July1686--1693Graph structured program evolution22007a Fibonacci programming, genetic factorial, list sequence, automatic based graph algorithms, exponentiation, reversing In recent years a lot of Automatic Programming techniques have developed. A typical example of Automatic Programming is Genetic Programming (GP), and various extensions and representations for GP have been proposed so far. However, it seems that more improvements are necessary to obtain complex programs automatically. In this paper we proposed a new method called Graph Structured Program Evolution (GRAPE). The representation of GRAPE is graph structure, therefore it can represent complex programs (e.g. branches and loops) using its graph structure. Each program is constructed as an arbitrary directed graph of nodes and data set. The GRAPE program handles multiple data types using the data set for each type, and the genotype of GRAPE is the form of a linear string of integers. We apply GRAPE to four test problems, factorial, Fibonacci sequence, exponentiation and reversing a list, and demonstrate that the optimum solution in each problem is obtained by the GRAPE system.http://www.bibsonomy.org/bibtex/207a2633a9ca70d96d610d079ffeec1c7/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00Geiringer mutation crossover, on distribution, process, schemata, walk a group, algorithms, random stationary Markov programming, genetic theorem, <span style="color:#555555;">Boris <a href="http://www.bibsonomy.org/author/Mitavskiy">Mitavskiy</a> and Jonathan <a href="http://www.bibsonomy.org/author/Rowe">Rowe</a> </span><em>Evolutionary Computation</em><em>14(1):87--118</em><em>Spring2006. </em>Thu Jun 19 17:35:00 CEST 2008Evolutionary ComputationSpring187--118An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms142006Geiringer mutation crossover, on distribution, process, schemata, walk a group, algorithms, random stationary Markov programming, genetic theorem, he frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. The original Geiringer theorem tells us the limiting frequency of occurrence of a given individual under repeated application of crossover alone for the classical genetic algorithm. Recently, Geiringer's theorem has been generalised to include the case of linear GP with homologous crossover (which can also be thought of as a variable length GA). In the current paper we prove a general theorem which tells us that under rather mild conditions on a given evolutionary algorithm, call it A, the stationary distribution of a certain Markov chain of populations in the absence of selection is unique and uniform. This theorem not only implies the already existing versions of Geiringer's theorem, but also provides a recipe of how to obtain similar facts for a rather wide class of evolutionary algorithms. The techniques which are used to prove this theorem involve a classical fact about random walks on a group and may allow us to compute and/or estimate the eigenvalues of the corresponding Markov transition matrix which is directly related to the rate of convergence towards the unique limiting distribution.http://www.bibsonomy.org/bibtex/295f825acc515656013c1d4dfd54a32bc/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00genetic algorithms, mapping gate programming look a logic field technology aids, synthesiser, flowMap, experimentation, up array, circuit performance hybridised programmable and parallel table, programming, design <span style="color:#555555;">Wai Shing <a href="http://www.bibsonomy.org/author/Lau">Lau</a> and Kin Hong <a href="http://www.bibsonomy.org/author/Lee">Lee</a> and Kwong Sak <a href="http://www.bibsonomy.org/author/Leung">Leung</a> </span><em>GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation, </em><em>1, </em><em>page839--846. </em><em>Seattle, Washington, USA, </em><em>ACM Press, </em><em>8-12 July2006. </em>Thu Jun 19 17:35:00 CEST 2008Seattle, Washington, USA{GECCO 2006:} Proceedings of the 8th annual conference on Genetic and evolutionary computation8-12 July839--846A hybridized genetic parallel programming based logic circuit synthesizer12006genetic algorithms, mapping gate programming look a logic field technology aids, synthesiser, flowMap, experimentation, up array, circuit performance hybridised programmable and parallel table, programming, design http://www.bibsonomy.org/bibtex/286a99aa72a4a0d35d04f0b2e374c882d/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00a Paradigm-Oriented algorithms, and programming, Skeletons, Distributed Programming Bound Computing, Bag Branch Task, Agents, Mobile of genetic <span style="color:#555555;">Hairong <a href="http://www.bibsonomy.org/author/Kuang">Kuang</a> and Lubomir F. <a href="http://www.bibsonomy.org/author/Bic">Bic</a> and Michael B. <a href="http://www.bibsonomy.org/author/Dillencourt">Dillencourt</a> </span><em>Proceedings of the The 20th International Conference on Distributed Computing Systems (ICDCS 2000), </em><em>page11--19. </em><em>Taipei, Taiwan, </em><em>IEEE Computer Society, </em><em>April 10-132000. </em>Thu Jun 19 17:35:00 CEST 2008Taipei, TaiwanProceedings of the The 20th International Conference on Distributed Computing Systems (ICDCS 2000)April 10-1311--19Paradigm-Oriented Distributed Computing Using Mobile Agents2000a Paradigm-Oriented algorithms, and programming, Skeletons, Distributed Programming Bound Computing, Bag Branch Task, Agents, Mobile of genetic We describe the implementation underlying an environment for distributed computing that uses the concept of well-known paradigms. The main advantage of paradigmoriented distributed computing is that the user only needs to specify application-specific sequential code, while the underlying infrastructure takes care of the parallelization and distribution. The main features of the proposed approach, called PODC, which differentiate it from other approaches, are the following: (1) It is intended for looselycoupled network environments, not specialized multiprocessors; (2) it is based on an infrastructure of mobile agents; (3) it supports programming in C, rather than a functional or special-purpose language, and (4) it provides a Webbased interactive graphics interface through which programs are constructed, invoked, and monitored. The three paradigms presently supported in PODC are the bag-oftasks, the branch-and-bound, and genetic programming. We describe their implementation and performance within the mobile agent-based PODC environment.http://www.bibsonomy.org/bibtex/24c713e974de2ff377061d7071b937108/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00a definitions length external genetic overheads, linear crossover internal computational operator, equal fragments, code algorithms, programming, register-machine, register individuals, output of computation, fitness page-based priori evolutionary <span style="color:#555555;">M. I. <a href="http://www.bibsonomy.org/author/Heywood">Heywood</a> and A. N. <a href="http://www.bibsonomy.org/author/Zincir-Heywood">Zincir-Heywood</a> </span><em>Systems, Man, and Cybernetics, 2000 IEEE International Conference, </em><em>5, </em><em>page3823--3828. </em><em>IEEE Press, </em><em>8-11 October2000. </em>Thu Jun 19 17:35:00 CEST 2008IEEE PressSystems, Man, and Cybernetics, 2000 IEEE International Conference8-11 October3823--3828Page-based linear genetic programming52000a definitions length external genetic overheads, linear crossover internal computational operator, equal fragments, code algorithms, programming, register-machine, register individuals, output of computation, fitness page-based priori evolutionary Genetic programming arguably represents the most general form of evolutionary computation. However, such generality is not without significant computational overheads. Particularly, the cost of evaluating the fitness of individuals in any form of evolutionary computation represents the single most significant computational bottleneck. A less widely acknowledged computational overhead in GP involves the implementation of the crossover operator. To this end a page-based definition of individuals is used to restrict crossover to equal length code fragments. Moreover, by using a register-machine context, the significance of a priori internal register external output definitions is emphasized.http://www.bibsonomy.org/bibtex/218c21f34004da64939bd041e83cf719e/speedyveganspeedyvegan2008-05-18T14:42:03+02:00a <span style="color:#555555;">Hans-G&#252;nter Hirsch Harald <a href="http://www.bibsonomy.org/author/Finster">Finster</a> </span><em>Tagungsband der 15.Konferenz Sprachsignalverarbeitung, Studientexte zur Sprachkommunikation Band 30</em><em>092004. </em>Sun May 18 14:42:03 CEST 2008Tagungsband der 15.Konferenz Sprachsignalverarbeitung, Studientexte zur Sprachkommunikation Band 3009125-132Bestimmung der optimalen HMM Parameter zur robusten phonembasierten Spracherkennung2004a http://www.bibsonomy.org/bibtex/2a1160e23808cebac194c3a0d0759c9ac/smichasmicha2008-04-28T14:02:50+02:00Transition to union a monetary <span style="color:#555555;">Frank <a href="http://www.bibsonomy.org/author/Bohn">Bohn</a> </span><em>Journal of Policy Modeling</em><em>28(3):247--276</em><em>Apr2006. </em>Mon Apr 28 14:02:50 CEST 2008Journal of Policy ModelingApr3247--276Maastricht Criteria versus Stability Pact282006Transition to union a monetary http://www.bibsonomy.org/bibtex/2ace6cf57ed186a22fb5b5cf2a89f5375/smichasmicha2008-04-23T22:05:04+02:00generalized form A quadratic <span style="color:#555555;">Yi <a href="http://www.bibsonomy.org/author/Zhao">Zhao</a> </span><em>Statistics \&amp; Probability Letters</em><em>21(2):131--140</em><em>Sep1994. </em>Wed Apr 23 22:05:04 CEST 2008Statistics \& Probability LettersSep2131--140Covariance matrices of quadratic forms in elliptical distributions211994generalized form A quadratic 23http://www.bibsonomy.org/bibtex/2e992f63baaa7006788a4382eac230364/smichasmicha2008-04-23T22:05:04+02:00of estimator Bias a robust <span style="color:#555555;">Santiago <a href="http://www.bibsonomy.org/author/Velilla">Velilla</a> </span><em>Statistics \&amp; Probability Letters</em><em>37(3):269--278</em><em>Mar1998. </em>Wed Apr 23 22:05:04 CEST 2008Statistics \& Probability LettersMar3269--278A note on the behaviour of residual plots in regression371998of estimator Bias a robust 16http://www.bibsonomy.org/bibtex/202ce9245eb1719a1c424ae02449f6bfb/smichasmicha2008-04-23T22:05:04+02:00with 1) property matrices string (0, a <span style="color:#555555;">Bikas Kumar <a href="http://www.bibsonomy.org/author/Sinha">Sinha</a> and Rita <a href="http://www.bibsonomy.org/author/Saha">Saha</a> </span><em>Journal of Statistical Planning and Inference</em><em>8(3):365--374</em><em>Dec1983. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceDec3365--374Optimal weighing designs with a string property81983with 1) property matrices string (0, a http://www.bibsonomy.org/bibtex/26bdf67c6c7acb98cebbe55ac927540a4/smichasmicha2008-04-23T22:05:04+02:00treatments a to v test control Comparing <span style="color:#555555;">D. <a href="http://www.bibsonomy.org/author/Richard Cutler">Richard Cutler</a> </span><em>Journal of Statistical Planning and Inference</em><em>36(1):107--125</em><em>Jul1993. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceJul1107--125Efficient block designs for comparing test treatments to a control when the errors are correlated361993treatments a to v test control Comparing http://www.bibsonomy.org/bibtex/22569d378733aaf42c5a0a527ec7f554a/smichasmicha2008-04-23T22:05:04+02:00of a Estimabilitty distribution <span style="color:#555555;">Federico J. <a href="http://www.bibsonomy.org/author/O&#039;Reilly">O'Reilly</a> and Alberto <a href="http://www.bibsonomy.org/author/Castillo">Castillo</a> </span><em>Journal of Statistical Planning and Inference</em><em>9(2):195--198</em><em>Mar1984. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceMar2195--198Estimability and linearity in normal regression91984of a Estimabilitty distribution http://www.bibsonomy.org/bibtex/2ac48eba05c8b3df708b68d9f5a426394/smichasmicha2008-04-23T22:05:04+02:00of a random matrix submatrix Nonsingularity orthogonal <span style="color:#555555;">Takeaki <a href="http://www.bibsonomy.org/author/Kariya">Kariya</a> and C. F. J. <a href="http://www.bibsonomy.org/author/Wu">Wu</a> </span><em>Journal of Statistical Planning and Inference</em>(<em>1985</em>)Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and Inference353--357On the nonsingularity of principal submatrices of a random orthogonal matrix121985of a random matrix submatrix Nonsingularity orthogonal http://www.bibsonomy.org/bibtex/29b033ba498da6285022781ce8e04a21a/smichasmicha2008-04-23T22:05:04+02:00a control Multiple with comparisons <span style="color:#555555;">Shanti S. <a href="http://www.bibsonomy.org/author/Gupta">Gupta</a> and Klaus J. <a href="http://www.bibsonomy.org/author/Miescke">Miescke</a> </span><em>Journal of Statistical Planning and Inference</em>(<em>1985</em>)Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and Inference161--169Minimax multiple t-tests for comparing k normal populations with a control121985a control Multiple with comparisons http://www.bibsonomy.org/bibtex/2ed4fad53d7ceb69b70e4c949707bc742/smichasmicha2008-04-23T22:05:04+02:00hypotheses A ordered priori <span style="color:#555555;">Livio <a href="http://www.bibsonomy.org/author/Finos">Finos</a> and Luigi <a href="http://www.bibsonomy.org/author/Salmaso">Salmaso</a> </span><em>Journal of Statistical Planning and Inference</em><em>137(12):3859--3870</em><em>Dec2007. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceDec123859--3870FDR- and FWE-controlling methods using data-driven weights1372007hypotheses A ordered priori 01http://www.bibsonomy.org/bibtex/2b7de1062885564fcca7efe8407977a01/smichasmicha2008-04-23T22:05:04+02:00criterion A <span style="color:#555555;">Lih-Yuan <a href="http://www.bibsonomy.org/author/Deng">Deng</a> and Dennis K. J. <a href="http://www.bibsonomy.org/author/Lin">Lin</a> and Jiannong <a href="http://www.bibsonomy.org/author/Wang">Wang</a> </span><em>Statistics \&amp; Probability Letters</em><em>28(3):203--209</em><em>Jul1996. </em>Wed Apr 23 22:05:04 CEST 2008Statistics \& Probability LettersJul3203--209A measurement of multi-factor orthogonality281996criterion A http://www.bibsonomy.org/bibtex/2f7f4eddd373ec565652697875893005c/smichasmicha2008-04-23T22:05:04+02:00Comparing treatments a control to test v <span style="color:#555555;">D. <a href="http://www.bibsonomy.org/author/Richard Cutler">Richard Cutler</a> </span><em>Journal of Statistical Planning and Inference</em><em>37(3):393--412</em><em>Dec1993. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceDec3393--412Efficient block designs for comparing test treatments to a control when the errors are correlated371993Comparing treatments a control to test v http://www.bibsonomy.org/bibtex/24141aebf5eb6a324d676bf6c4e08df5d/smichasmicha2008-04-23T22:05:04+02:00vaccine a Assessing <span style="color:#555555;">Niels G. <a href="http://www.bibsonomy.org/author/Becker">Becker</a> and Tom <a href="http://www.bibsonomy.org/author/Britton">Britton</a> </span><em>Journal of Statistical Planning and Inference</em><em>96(1):41--66</em><em>Jun2001. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceJun141--66Design issues for studies of infectious diseases962001vaccine a Assessing 01