7943 search results - page 1214 / 1589 » A calculus for costed computations |
186
click to vote
EUROPAR
2007
Springer
16 years 1 months ago
2007
Springer
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
165
Voted
FSE
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong et al. at FSE 2006. This cryptanalysis is based on some unexpected differential...
288
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
182
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
It is not unusual for a software development organization to expend 40 percent of total project effort on testing, which can be a very laborious and time-consuming process. Thus, ...
185
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...