Sciweavers

3433 search results - page 380 / 687
» Heuristics for a bidding problem
Sort
View
GECCO
2004
Springer
244views Optimization» more  GECCO 2004»
16 years 6 days ago
Using Clustering Techniques to Improve the Performance of a Multi-objective Particle Swarm Optimizer
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 ...
Gregorio Toscano Pulido, Carlos A. Coello Coello
ACSAC
2003
IEEE
16 years 3 days ago
Automatic Reassembly of Document Fragments via Context Based Statistical Models
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...
Kulesh Shanmugasundaram, Nasir D. Memon
HICSS
2003
IEEE
94views Biometrics» more  HICSS 2003»
16 years 3 days ago
A Hop Constrained Min-Sum Arborescence with Outage Costs
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...
Rakesh Kawatra
168
Voted
ISCAS
2003
IEEE
91views Hardware» more  ISCAS 2003»
16 years 3 days ago
SDP for multi-criterion QMF bank design
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...
H. D. Tuan, L. H. Nam, H. Tuy, T. Q. Nguyen
ISQED
2003
IEEE
85views Hardware» more  ISQED 2003»
16 years 3 days ago
Static Pin Mapping and SOC Test Scheduling for Cores with Multiple Test Sets
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...
Yu Huang, Wu-Tung Cheng, Chien-Chung Tsai, Nilanja...