5757 search results - page 913 / 1152 » Dynamic Policy Programming |
128
click to vote
ASAP
2004
IEEE
15 years 4 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
104
Voted
CODES
2004
IEEE
15 years 4 months ago
2004
IEEE
In this paper, we present an approach for automatic synthesis of System on Chip (SoC) multiprocessor architectures for applications expressed as process networks. Our approach is ...
103
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
125
click to vote
DEEC
2006
IEEE
15 years 4 months ago
2006
IEEE
Abstract. Engineering workflow applications are becoming more and more complex, involving numerous interacting business objects within considerable processes. Analysing the interac...
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...