نتایج جستجو برای: solution mapping
تعداد نتایج: 653311 فیلتر نتایج به سال:
The goal of this paper is to study the parametric vector equilibrium problems governed by vector topologically pseudomonotone maps. The main result gives sufficient conditions for closedness of the solution map defined on the set of parameters.
This paper reports the work of creating bilingual mappings in English for certain synsets of Hindi wordnet, the need for doing this, the methods adopted and the tools created for the task. Hindi wordnet, which forms the foundation for other Indian language wordnets, has been linked to the English WordNet. To maximize linkages, an important strategy of using direct and hypernymy linkages has bee...
In this paper, we address an important problem associated with hierarchical design flows (termed the mapping problem): identifying correspondences between a signal in a high-level specification and a net in its lower level implementation. Conventional techniques use shared names to associate a signal with a net whenever possible. However, given that a synthesis flow may not preserve names, such...
There is a growing need to define a semantic mapping from a database schema to an ontology. Such a mapping is an integral part of the data integration systems that use an ontology as a unified global view. However, both ontologies and database schemas evolve over time in order to accommodate updated information needs. Once the ontology and the database schema associated with a semantic mapping ...
This paper investigates how the use of the trivial voting (TV) mapping influences the performance of genetic algorithms (GAs). The TV mapping is a redundant representation for binary phenotypes. A population sizing model is presented that quantitatively predicts the influence of the TV mapping and variants of this encoding on the performance of GAs. The results indicate that when using this enc...
Analogical problem solving is mostly described as transfer of a source solution to a target problem based on the structural correspondences (mapping) between source and target. Derivational analogy (Carbonell, 1986) proposes an alternative view: A target problem is solved by replaying a remembered problem solving episode. Thus, the experience with the source problem is used to guide the search ...
In common genetic programming approaches, the space of genotypes, that is the search space, is identical to the space of phenotypes, that is the solution space. Facts and theories from molecular biology suggest the introduction of non-identical ge-nospaces and phenospaces, and a generic genotype-phenotype mapping which maps unconstrained genotypes into syntactically correct phenotypes. Neutral ...
Particle swarm optimization algorithm is easy to reach premature convergence in the solution process, and fall into the local optimal solution. Aiming at the problem, this paper proposes a particle swarm optimization algorithm with chaotic mapping (CM-PSO). The algorithms uses chaotic mapping function to optimize the initial state of population, improve the probability of obtain optimal solutio...
elastic solutions applicable to single underground openings usually suffer from geometry related simplification. most tunnel shapes possess two axes of symmetry while a wide range of geometries used in tunneling practice involve only one symmetry axis. d-shape or horse-shoe shape tunnels and others with arched roof and floor are examples of the later category (one symmetry axis). in the present...
Background and Aim: Brain mapping is a study of the anatomy and function of the CNS (central nervous system). Brain mapping has many techniques and these techniques are permanently changing and updating. From the beginning, brain mapping was invasive and for brain mapping, electrical stimulation of the exposed brain was needed. However, nowadays brain mapping does not require electrical stimula...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید