2006 search results - page 2 / 402 » Heuristic Security-Testing Methods |
JMLR
2010
12 years 12 months ago
2010
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
JDCTA
2010
13 years 1 hour ago
2010
Parameter (or variable) of automotive embedded networked control system is named as signal. In order to improve system performance and provide more remaining bandwidth for system ...
IJMTM
2011
13 years 5 days ago
2011
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
CEC
2011
IEEE
12 years 5 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
GECCO
2011
Springer
12 years 8 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...