evolcomp - Centre for Policy Modelling
... Variety is a key component of evolution. Examples might be “the bone structure is more complex as there is a greater variety of basic shapes” or “this species markings are complex due to their great variety”. As with the above ideas the implication is not both ways; some variety is necessary for com ...
... Variety is a key component of evolution. Examples might be “the bone structure is more complex as there is a greater variety of basic shapes” or “this species markings are complex due to their great variety”. As with the above ideas the implication is not both ways; some variety is necessary for com ...
Necessary conditions on minimal system configuration for general
... What are the necessary conditions under which fuzzy systems can possibly be universal approximators but with as minimal system configuration as possible? We have established such necessary conditions for the general single-input single-output (SISO) Mamdani fuzzy systems and a MISO Mamdani fuzzy sys ...
... What are the necessary conditions under which fuzzy systems can possibly be universal approximators but with as minimal system configuration as possible? We have established such necessary conditions for the general single-input single-output (SISO) Mamdani fuzzy systems and a MISO Mamdani fuzzy sys ...
Optimizing Network Resource Sharing in Grids
... scaled scaled Bin (i) and Bout (e) are adopted to rule out the possibility where one access point has no requests at all; thus, the capacity of this point shall be excluded when calculating resource utilization. ...
... scaled scaled Bin (i) and Bout (e) are adopted to rule out the possibility where one access point has no requests at all; thus, the capacity of this point shall be excluded when calculating resource utilization. ...
Weighted Automata
... the same structural properties. Consider the following problems, which all share a common structure: 1. computing the language of/a regular expression for a given NFA, 2. finding shortest paths between all pairs of vertices in a graph, 3. computing the transitive closure of the edge relation of a gr ...
... the same structural properties. Consider the following problems, which all share a common structure: 1. computing the language of/a regular expression for a given NFA, 2. finding shortest paths between all pairs of vertices in a graph, 3. computing the transitive closure of the edge relation of a gr ...
Multiway Spatial Joins - Department of Computer Science, HKU
... overcome the difficulties raised by their spatial extent and dimensionality. The first known algorithm [Orenstein 1986] uses a grid to regularly divide the multidimensional space into small blocks, called pixels, and employs a space-filling curve (z-ordering) [Bially 1969] to order them. Each object ...
... overcome the difficulties raised by their spatial extent and dimensionality. The first known algorithm [Orenstein 1986] uses a grid to regularly divide the multidimensional space into small blocks, called pixels, and employs a space-filling curve (z-ordering) [Bially 1969] to order them. Each object ...
HAPLO-ASP: Haplotype Inference Using Answer Set Programming
... propositional theory prepared for MINISAT by SHIP S is smaller than the one prepared by H APLO -ASP. Experimenting with HIPAG Problems. We have compared H APLO -ASP with the haplotype inference system H APLO -IHP [7] with respect to the computation time and the accuracy of generated haplotypes. We h ...
... propositional theory prepared for MINISAT by SHIP S is smaller than the one prepared by H APLO -ASP. Experimenting with HIPAG Problems. We have compared H APLO -ASP with the haplotype inference system H APLO -IHP [7] with respect to the computation time and the accuracy of generated haplotypes. We h ...
CS184a: Computer Architecture (Structures and Organization)
... – We can implement any computation by interconnecting a sufficiently large network of NAND gates Caltech CS184a Fall2000 -- DeHon ...
... – We can implement any computation by interconnecting a sufficiently large network of NAND gates Caltech CS184a Fall2000 -- DeHon ...
PDF
... we model specifications in M TL. Moreover, the aim of our study is to identify the class of complexity of automated addition of different types of time-bounded liveness properties and possibly devising algorithms that can be used in tools for synthesizing real-time programs. The main results in this ...
... we model specifications in M TL. Moreover, the aim of our study is to identify the class of complexity of automated addition of different types of time-bounded liveness properties and possibly devising algorithms that can be used in tools for synthesizing real-time programs. The main results in this ...
pdf
... two contexts: synthesizing programs from specification, where the entire specification is given, and synthesizing programs from existing programs along with a fully or partially available new specification. In approaches where the entire specification must be available, changes in specification, e.g ...
... two contexts: synthesizing programs from specification, where the entire specification is given, and synthesizing programs from existing programs along with a fully or partially available new specification. In approaches where the entire specification must be available, changes in specification, e.g ...
Qualitative Spatial Reasoning: Framework and Frontiers
... We believe there are deep reasons for human reliance on perceptual abilties for spatial reasoning, and that these reasons dominate the structure of theories for spatial reasoning in both people or machines. Our concise statement of this idea is the Poverty Conjecture (Forbus, Nielsen, & Faltings, 1 ...
... We believe there are deep reasons for human reliance on perceptual abilties for spatial reasoning, and that these reasons dominate the structure of theories for spatial reasoning in both people or machines. Our concise statement of this idea is the Poverty Conjecture (Forbus, Nielsen, & Faltings, 1 ...
Case-Based Reasoning
... the most similar case. Thus one sub-branch of CBR research deals with methods that improve retrieval efficiency, e.g. by using specific index structures such as kd-trees, case-retrieval nets, or discrimination networks (an overview is given in [9]). ...
... the most similar case. Thus one sub-branch of CBR research deals with methods that improve retrieval efficiency, e.g. by using specific index structures such as kd-trees, case-retrieval nets, or discrimination networks (an overview is given in [9]). ...
QUANTUM – TYPE AND CONTINUOUS COMPRESSIONS Author:I. Szalay
... x c is called the c –compressed of x and R c is called the c- compressed of the real number line. If S R then the set S c x c R c : x S is called the c – compressed of S. The inverse of compressor ...
... x c is called the c –compressed of x and R c is called the c- compressed of the real number line. If S R then the set S c x c R c : x S is called the c – compressed of S. The inverse of compressor ...
Introduction to Artificial Intelligence
... Search algorithms are core tool for decision making, especially when the domain is too complex to use alternatives like Dynamic Programming. In recent years, with the increase in computational power search methods became the method of choice for complex domains, like the game of Go, or certain POMDP ...
... Search algorithms are core tool for decision making, especially when the domain is too complex to use alternatives like Dynamic Programming. In recent years, with the increase in computational power search methods became the method of choice for complex domains, like the game of Go, or certain POMDP ...
2. Model for Composition Analysis - The University of Texas at Dallas
... model. We replace the notion of actors by a virtual functional unit, called a module. A module is specified by its functional requirement and the descriptions for each data input and output. It has to be instantiated by an actual component in the repository. Since there may exist multiple components ...
... model. We replace the notion of actors by a virtual functional unit, called a module. A module is specified by its functional requirement and the descriptions for each data input and output. It has to be instantiated by an actual component in the repository. Since there may exist multiple components ...
Slayt 1
... SONIA; a knowledge-based job-shop predictive-reactive scheduling system Schedule repair heuristics; Relaxing due dates Extending work shifts Operation postponed until the next shift Reduction of idle times of resources by permuting operations ...
... SONIA; a knowledge-based job-shop predictive-reactive scheduling system Schedule repair heuristics; Relaxing due dates Extending work shifts Operation postponed until the next shift Reduction of idle times of resources by permuting operations ...
An Efficient Algorithm for Finding Similar Short Substrings from
... For the problem of finding substrings of S with the shortest Hamming distance to Q, Abrahamson[1] proposed an algorithm running in O(|S|(|Q| log |Q|)1/2 ) time. If the maximum Hamming distance is k, the computation time can be reduced to O(|S|(k log k)1/2 )[4]. Some approximation approaches have been ...
... For the problem of finding substrings of S with the shortest Hamming distance to Q, Abrahamson[1] proposed an algorithm running in O(|S|(|Q| log |Q|)1/2 ) time. If the maximum Hamming distance is k, the computation time can be reduced to O(|S|(k log k)1/2 )[4]. Some approximation approaches have been ...
E - Read
... – 2n+o(n) by Bent and John (STOC 1985) – (2+2-80)n by Dor and Zwick (FOCS 1996, SIAM Journal on Discrete Math 2001). ...
... – 2n+o(n) by Bent and John (STOC 1985) – (2+2-80)n by Dor and Zwick (FOCS 1996, SIAM Journal on Discrete Math 2001). ...
RTP Bacteria DNA Mini Kit
... tissue, urine, paper points, swabs and water using the RTP® technology. This kit technology yields bacterial DNA from different human samples that is free of proteins, nucleases and other impurities and is ready to use for different downstream applications, such as PCR, quantitative PCR and others. ...
... tissue, urine, paper points, swabs and water using the RTP® technology. This kit technology yields bacterial DNA from different human samples that is free of proteins, nucleases and other impurities and is ready to use for different downstream applications, such as PCR, quantitative PCR and others. ...
A New Torus Bounding for Line-Torus Intersection
... geometric problems and CAD/CAM systems. Intersection algorithms are well documented for linear cases, e.g. line-plane or line-triangle etc., and also for some specific non-linear surfaces like line-sphere intersection etc. However, there are other objects like bicubic parametric patches, torus etc. ...
... geometric problems and CAD/CAM systems. Intersection algorithms are well documented for linear cases, e.g. line-plane or line-triangle etc., and also for some specific non-linear surfaces like line-sphere intersection etc. However, there are other objects like bicubic parametric patches, torus etc. ...
DOCUMENT RESUME ED 291 578 SE 048 910 AUTHOR Browning
... The study utilized a 2 X 2 fully randomized, factorial, experimental design with each independent variable at two, fixed levels. ...
... The study utilized a 2 X 2 fully randomized, factorial, experimental design with each independent variable at two, fixed levels. ...
Link-State Routing with Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering Dahai Xu
... belief, the optimal TE method in [3] is not distributed link-state routing, and the following question remains open: can a linkstate protocol with hop-by-hop forwarding achieve optimal TE? This paper shows that the answer is in fact positive, by developing a new link-state protocol, Penalizing Expon ...
... belief, the optimal TE method in [3] is not distributed link-state routing, and the following question remains open: can a linkstate protocol with hop-by-hop forwarding achieve optimal TE? This paper shows that the answer is in fact positive, by developing a new link-state protocol, Penalizing Expon ...
Paper ~ Which Algorithm Should I Choose At Any Point of the
... 2.3 Merits of Our Approach In this paper, we present a novel alternative approach which overcomes the above limitations. It does not require the global optimal solution to be known; it works on a single problem instance with little or no a prior knowledge; it does not introduce any new control param ...
... 2.3 Merits of Our Approach In this paper, we present a novel alternative approach which overcomes the above limitations. It does not require the global optimal solution to be known; it works on a single problem instance with little or no a prior knowledge; it does not introduce any new control param ...
On a recursive formulation for solving inverse form finding problems
... to inverse analysis of large-displacement beams in the elastic range. Lu, 2007 [11] proposed a computational method of inverse elastostatics for anisotropic hyperelastic solids in the context of fibrous hyperelastic solids and provide explicit stress function for soft tissue models. In [12] an inver ...
... to inverse analysis of large-displacement beams in the elastic range. Lu, 2007 [11] proposed a computational method of inverse elastostatics for anisotropic hyperelastic solids in the context of fibrous hyperelastic solids and provide explicit stress function for soft tissue models. In [12] an inver ...