1927 search results - page 64 / 386 » UMDAs for dynamic optimization problems |
118
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
109
Voted
JVA
2006
IEEE
15 years 6 months ago
2006
IEEE
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
117
click to vote
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
100
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
105
Voted
IANDC
2006
15 years 18 days ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...