331 search results - page 10 / 67 » New Results on the Pseudorandomness of Some Blockcipher Cons... |
AE
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
IJCNLP
2004
Springer
14 years 2 months ago
2004
Springer
In a text categorization task, classification on some hierarchy of classes shows better results than the case without the hierarchy. In current environments where large amount of ...
IJCAI
2003
13 years 10 months ago
2003
Ensemble methods like bagging and boosting that combine the decisions of multiple hypotheses are some of the strongest existing machine learning methods. The diversity of the memb...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
This paper proposes a new Evolutionary Algorithm for the Dynamic Resource Constrained Project Scheduling Problem. This algorithm has new features that get around some problems lik...
EUROCRYPT
2007
Springer
14 years 3 months ago
2007
Springer
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....