Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Although unstructured mesh algorithms are a popular means of solving problems across a broad range of disciplines—from texture mapping to computational fluid dynamics—they ar...
Brian S. White, Sally A. McKee, Bronis R. de Supin...
The entity and relation recognition, i.e. (1) assigning semantic classes to entities in a sentence, and (2) determining the relations held between entities, is an important task in...
The difficulty of obtaining data from impostors and the scarcity of data are two factors that have a large influence in the estimation of speakerdependent thresholds in text-depend...
Abstract. Self-localization in dynamic environments is a central problem in mobile robotics and is well studied in the literature. One of the most popular methods is the Monte Carl...
Andreas Strack, Alexander Ferrein, Gerhard Lakemey...