12950 search results - page 147 / 2590 » On Optimal Timed Strategies |
131
click to vote
DIS
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
145
Voted
CP
2003
Springer
15 years 9 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
131
click to vote
DATE
2002
IEEE
15 years 9 months ago
2002
IEEE
Intra-iteration data reuse occurs when multiple array references exhibit data reuse in a single loop iteration. An optimizing compiler can exploit this reuse by clustering (in the...
115
click to vote
ICEC
1994
15 years 5 months ago
1994
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
140
click to vote
JUCS
2008
15 years 4 months ago
2008
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...