14 search results - page 2 / 3 » Comparison of Instances Seletion Algorithms I. Algorithms Su... |
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Many data mining applications involve the task of building a model for predictive classification. The goal of such a model is to classify examples (records or data instances) into...
GECCO
2009
Springer
15 years 1 months ago
2009
Springer
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
TRIDENTCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
Several difficulties arise when testing network security algorithms. First, using network data captured at a router does not guarantee that any instances of the security event of...
SOFTVIS
2010
ACM
14 years 7 months ago
2010
ACM
This paper presents a novel environment for the visual design and prototyping of computer vision systems. The proposed environment consists of a modular architecture, where each m...