2005
DOI: 10.1016/s0169-7161(04)24013-5
|View full text |Cite
|
Sign up to set email alerts
|

On Genetic Algorithms and their Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(9 citation statements)
references
References 12 publications
0
7
0
Order By: Relevance
“…79 The use of evolutionary and neural-fuzzy techniques in enhancing the dialog in human-computer interaction systems is currently a very important approach in Natural Language Processing. 1,13,88,52 Zuckerman et al have recently presented a numerical mechanism for the interpretation of spoken referring expressions. Their proposal considers multiple alternatives at different interpretation stages (speech, syntax, semantics, and pragmatics) and combines distance-based functions that represent lexical similarity using two approaches, viz multiplicative and additive.…”
Section: Related Workmentioning
confidence: 99%
“…79 The use of evolutionary and neural-fuzzy techniques in enhancing the dialog in human-computer interaction systems is currently a very important approach in Natural Language Processing. 1,13,88,52 Zuckerman et al have recently presented a numerical mechanism for the interpretation of spoken referring expressions. Their proposal considers multiple alternatives at different interpretation stages (speech, syntax, semantics, and pragmatics) and combines distance-based functions that represent lexical similarity using two approaches, viz multiplicative and additive.…”
Section: Related Workmentioning
confidence: 99%
“…Calculus-based versus guided random search techniques were tested through comparison of different solvers whereas enumerative algorithms were discarded since "they cannot compete to the robustness race" when compared with the aforementioned techniques mainly due to the characteristics of their search domains (Said 2005).…”
Section: Optimizationmentioning
confidence: 99%
“…Techniques used during optimization to exhaust the search space are classified in three groups: (1) calculus-based techniques, (2) guided random search techniques, and (3) numerative techniques (Filho et al 1994). Calculus-based versus guided random search techniques were tested through comparison of different solvers whereas enumerative algorithms were discarded since "they cannot compete to the robustness race" when compared with the aforementioned techniques mainly due to the characteristics of their search domains (Said 2005).…”
Section: Optimizationmentioning
confidence: 99%
“…A search space defined by the problem and an objective function to be minimized (in this case a measure of an error function) in order to guide the search are also important components of the EA. EAs have been applied to very different problems in very different fields of research, in Physics, Chemistry, Computer Science or Civil Engineering problems [28,29,33]. Color quantization is an problem in Computer Science with extensions to image vision or even to robotics.…”
Section: Introductionmentioning
confidence: 99%