1215 search results - page 121 / 243 » Application domain study of evolutionary algorithms in optim... |
CEC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract— Mobile agents are often used in wireless sensor networks for distributed target detection with the goal of minimizing the transmission of non-critical data that negativ...
147
click to vote
ICS
1993
Tsinghua U.
15 years 5 months ago
1993
Tsinghua U.
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
CEC
2003
IEEE
15 years 6 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
174
click to vote
CP
2004
Springer
15 years 7 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
121
click to vote
CP
2009
Springer
15 years 8 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...