The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 221 –
240 of
384
Genetic algorithms are adaptive methods that use principles inspired by natural population genetics to evolve solutions to search and optimization problems. Genetic algorithms process a population of search space solutions with three operations: selection, crossover and mutation. A great problem in the use of genetic algorithms is premature convergence; the search becomes trapped in a local optimum before the global optimum is found. Fuzzy logic techniques may be used for solving this problem. This...
The paper focuses on the acceleration of the computer optimization of heat radiation intensity on the mould surface. The mould is warmed up by infrared heaters positioned above the mould surface, and in this way artificial leathers in the automotive industry are produced (e.g. for car dashboards). The presented heating model allows us to specify the position of infrared heaters over the mould to obtain approximately even heat radiation intensity on the whole mould surface. In this way we can obtain...
The value of knowing about data availability and system accessibility
is analyzed through theoretical models of Information Economics.
When a user places an inquiry for information, it is important for the user to
learn whether the system is not accessible or the data is not available, rather
than not have any response. In reality, various outcomes can be provided
by the system: nothing will be displayed to the user (e.g., a traffic light that
does not operate, a browser that keeps browsing, a telephone...
In this paper we give a simple proof that the
alternation-depth
hierarchy of the μ-calculus for binary trees is strict.
The witnesses for this strictness are the automata that determine
whether there is a winning strategy for the parity game
played on a tree.
Evolutionary Algorithms, also known as Genetic Algorithms in a former terminology, are probabilistic algorithms for optimization, which mimic operators from natural selection and genetics. The paper analyses the convergence of the heuristic associated to a special type of Genetic Algorithm, namely the Steady State Genetic Algorithm (SSGA), considered as a discrete-time dynamical system non-generational model. Inspired by the Markov chain results in finite Evolutionary Algorithms, conditions are...
The last few years have witnessed important new developments in the theory and practice of pattern classification. We intend to survey some of the main new ideas that have led to these recent results.
The last few years have witnessed important new developments in
the theory and practice of pattern classification. We intend to
survey some of the main new ideas that have led to these
recent results.
Currently displaying 221 –
240 of
384