In this paper, we present an extension of the heuristic called “particle swarm optimization” (PSO) that is able to deal with multiobjective optimization problems. Our approach ...
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
Quadraturemirror filter(QMF)bank with multi-criterion constraints suchas minimal aliasing and/or minimal error coding is amongthe most important problems in filter bank design, fo...
An algorithm for mapping core terminals to System-On-a-Chip (SOC) I/O pins and scheduling tests in order to achieve costefficient concurrent test for core-based designs is present...