2988 search results - page 189 / 598 » Experiments with a New Boosting Algorithm |
149
click to vote
EVOW
2001
Springer
15 years 9 months ago
2001
Springer
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
155
click to vote
CHES
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Three new types of power analysis attacks against smartcard implementations of modular exponentiation algorithms are described. The first attack requires an adversary to ...
173
click to vote
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
127
click to vote
SGAI
2004
Springer
15 years 10 months ago
2004
Springer
In Wrapper based feature selection, the more states that are visited during the search phase of the algorithm the greater the likelihood of finding a feature subset that has a high...
132
Voted
SDM
2010
SIAM
15 years 6 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...