6142 search results - page 430 / 1229 » The Complexity of Partition Functions |
154
click to vote
AUSAI
2007
Springer
16 years 1 months ago
2007
Springer
The traditional concept of a genetic algorithm (GA) is that of selection, crossover and mutation. However, a limited amount of data from the literature has suggested that the nich...
153
click to vote
FOCS
2005
IEEE
16 years 12 days ago
2005
IEEE
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...
185
click to vote
SEFM
2003
IEEE
16 years 2 days ago
2003
IEEE
Despite the advances in software engineering since 1968, current methods for going from a set of functional requirements to a design are not as direct, repeatable and constructive...
130
click to vote
DATE
1997
IEEE
15 years 11 months ago
1997
IEEE
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
238
click to vote
NCA
2006
IEEE
15 years 6 months ago
2006
IEEE
The use of multilayer perceptrons (MLP) with threshold functions (binary step function activations) greatly reduces the complexity of the hardware implementation of neural networks...