712 search results - page 47 / 143 » The Complexity of Constructing Evolutionary Trees Using Expe... |
127
Voted
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
148
click to vote
CEC
2009
IEEE
15 years 9 months ago
2009
IEEE
— Despite their success as optimization methods, evolutionary algorithms face many difficulties to design artifacts with complex structures. According to paleontologists, living...
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
— This work is motivated by the interest in finding significant movements in financial stock prices. The detection of such movements is important because these could represent...
122
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Evolutionary structural testing is an approach to automatically generating test cases that achieve high structural code coverage. It typically uses genetic algorithms (GAs) to sea...
106
click to vote
ATAL
2004
Springer
15 years 8 months ago
2004
Springer
Auctions are useful mechanisms for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders know their own valua...