2006 search results - page 185 / 402 » Heuristic Security-Testing Methods |
169
click to vote
ISSAC
2009
Springer
16 years 27 days ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
173
Voted
EVOW
2007
Springer
16 years 15 days ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
181
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
161
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
157
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...