15485 search results - page 673 / 3097 » Computing Optimal Subsets |
199
Voted
GECCO
2003
Springer
16 years 18 days ago
2003
Springer
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
210
click to vote
COCO
1995
Springer
15 years 11 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
174
click to vote
DEON
2008
Springer
15 years 9 months ago
2008
Springer
The paper a discusses the interaction properties between preference and choice of coalitions in a strategic interaction. A language is presented to talk about the conflict between...
147
click to vote
VMV
2001
15 years 8 months ago
2001
In this paper we address the problem of using quaternions in unconstrained nonlinear optimization of 3-D rotations. Quaternions representing rotations have four elements but only ...
175
click to vote
TSMC
2002
15 years 7 months ago
2002
Theproblemofautomateddefectdetectionintextured materials is investigated. A new approach for defect detection using linearFIRfilterswithoptimizedenergyseparationisproposed.Performa...