Background: Coevolutionary systems like hosts and their parasites are commonly used model systems for evolutionary studies. Inferring the coevolutionary history based on given phylogenies of both groups is often done ...
详细信息
We present an investigation into the genotype-phenotype map in Position Independent Grammatical Evolution (πGE). Previous studies have shown πGE to exhibit a performance increase over standard Grammatical Evolution ...
详细信息
We present an investigation into the genotype-phenotype map in Position Independent Grammatical Evolution (πGE). Previous studies have shown πGE to exhibit a performance increase over standard Grammatical Evolution ...
详细信息
We present an investigation into the genotype-phenotype map in Position Independent Grammatical Evolution (πGE). Previous studies have shown πGE to exhibit a performance increase over standard Grammatical Evolution (GE). The only difference between the two approaches is in how the genotype-phenotype mapping process is performed. GE uses a leftmost non terminal expansion, while πGE evolves the order of mapping as well as the content. In this study, we use the idea of focused search to examine which aspect of the πGE mapping process provides the lift in performance over standard GE by applying our approaches to three benchmark problems taken from specialised literature. We examined the traditional πGE approach and compared it to two setups which examined the extremes of mapping order search and content search, and against setups with varying ratios of content and order search. In all of these tests a purely content focused πGE was shown to exhibit a performance gain over the other setups.
The AAAI-10 workshop program was held on July 11-12, 2010, at the Westin Peachtree Plaza in Atlanta, Georgia. The workshop program included 13 workshops covering a wide range of topics in artificial intelligence. Ther...
详细信息
The AAAI-10 workshop program was held on July 11-12, 2010, at the Westin Peachtree Plaza in Atlanta, Georgia. The workshop program included 13 workshops covering a wide range of topics in artificial intelligence. There were several presentations on particular formalisms for combining the levels of planning from the perspectives of classical planning, motion planning, POMDPs, search-based planning, and temporal logic-based constraints. Henry Lieberman from Massachusetts Institute of Technology Media Laboratory presented work developing a platform for knowledge acquisition and usage from expert users, built upon experience with eliciting information from nonexperts in a collaborative manner. The objective of the AAAI Workshop on Goal-Directed Autonomy (GDA) was to encourage discussion and novel contributions on intelligent agents that can self-select their goals. Jeremy Baxter from QinetiQ focused on user interaction, while Nick Hawes described a goal-directed reasoning framework for controlling a mobile robot.
In this paper we look at systems consisting of many autonomous components or agents which have only limited amount of resources (e.g. memory) but are able to communicate with each other. The aim of these systems is to...
详细信息
A tandem duplication random loss (TDRL) operation duplicates a contiguous segment of genes, followed by the loss of one copy of each of the duplicated genes. Although the importance of this operation is founded by sev...
详细信息
It is known that for two given secondary structures (defined by position of base pairings) an RNA string can easily be found that can fold into both structures. But for more than two secondary structures this is not n...
详细信息
It is known that for two given secondary structures (defined by position of base pairings) an RNA string can easily be found that can fold into both structures. But for more than two secondary structures this is not necessarily possible. Moreover, when four or more secondary structures are given the problem to determine the least number of positions, such that after the removal of all incident base pairs, a compatible RNA sequence can be found, is known to be NP-complete (\cite{real_shapes}). In this paper we introduce pseudo edges that are used to forbid that certain base pairs can bind and therefore can be used to define the properties of possible RNA secondary structures. We study the complexity of the problem to design an RNA sequence that can fold into different secondary structures each of them is described by a set of required and forbidden base pairs. We refine the NP-completeness results of \cite{real_shapes} and show an analoguous NP-completeness result for the realization problem concerning the removal of (pseudo) edges. We also present a polynomial time method for checking the realizability of extended shape graphs. Furthermore, we empirically analyze the influence of pseudo edges on the realizability for sets of random RNA sequences and for sets of aptamers.
Interactive displays are increasingly being distributed in a broad spectrum of everyday life environments: they have very diverse form factors and portability characteristics, support a variety of interaction techniqu...
详细信息
Dynamically reconfigurable hardware offers promising possibilities for flexible, computation intensive applications. With the technological advance of reconfigurable hardware came a rapid growth in the number of resou...
详细信息
ISBN:
(纸本)9781424419606
Dynamically reconfigurable hardware offers promising possibilities for flexible, computation intensive applications. With the technological advance of reconfigurable hardware came a rapid growth in the number of resources per chip requiring large amounts of data transfer per reconfiguration. Especially run-time reconfigurable applications, which make frequent use of reconfiguration, suffer from the growing overhead induced thereby. In this project, we investigate novel concepts for reconfigurable architectures that can dynamically reconfigure the actual reconfiguration potential to reduce the total amount of reconfiguration data that is necessary for a computation.
There exists several FPGA architectures that can be partially reconfigured at run-time. The advantage of partial run-time reconfiguration is that it allows to develop new algorithmic solutions for many applications. B...
详细信息
ISBN:
(纸本)9781424419920
There exists several FPGA architectures that can be partially reconfigured at run-time. The advantage of partial run-time reconfiguration is that it allows to develop new algorithmic solutions for many applications. But a limiting factor for using frequent dynamic reconfiguration could be the reconfiguration overhead. In order to study the potential of frequent run-time reconfiguration it is interesting to investigate its costs and benefits from an abstract point of view and to develop new architectural concepts. In this paper, we provide a formal treatment of the reconfiguration costs and compare them for models of standard partially reconfigurable FPGAs and 2-level reconfigurable FPGAs.
暂无评论