Sciweavers

13376 search results - page 448 / 2676
» Problem Solving with
Sort
View
SSIAI
2002
IEEE
15 years 10 months ago
Two Dimensional Projective Point Matching
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
Jason Denton, J. Ross Beveridge
98
Voted
DM
2007
63views more  DM 2007»
15 years 5 months ago
On Sloane's generalization of non-squashing stacks of boxes
Recently, Sloane and Sellers solved a certain box stacking problem related to non– squashing partitions. These are defined as partitions n = p1 + p2 + · · · + pk with
George E. Andrews, James A. Sellers
117
Voted
JPDC
2006
133views more  JPDC 2006»
15 years 5 months ago
Grid computing for parallel bioinspired algorithms
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO
Nouredine Melab, Sébastien Cahon, El-Ghazal...
SUM
2007
Springer
15 years 11 months ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...
CEC
2009
IEEE
15 years 11 months ago
Comparing parameter tuning methods for evolutionary algorithms
Abstract— Tuning the parameters of an evolutionary algorithm (EA) to a given problem at hand is essential for good algorithm performance. Optimizing parameter values is, however,...
Selmar K. Smit, A. E. Eiben