526 search results - page 11 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
TEC
2002
14 years 9 months ago
2002
Most applications of evolutionary algorithms (EAs) deal with static optimization problems. However, in recent years, there has been a growing interest in timevarying (dynamic) prob...
TCS
2008
14 years 9 months ago
2008
We address the problem of detecting consensus motifs, that occur with subtle variations, across multiple sequences. These are usually functional domains in DNA sequences such as t...
76
Voted
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
91
Voted
CEC
2010
IEEE
14 years 9 months ago
2010
IEEE
— Developing a problem-domain independent methodology to automatically generate high performing solving strategies for specific problems is one of the challenging trends on hype...
CONPAR
1992
15 years 1 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...