304 search results - page 33 / 61 » Solving Generalized Small Inverse Problems |
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
FSTTCS
1998
Springer
13 years 12 months ago
1998
Springer
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...
AAAI
2004
13 years 9 months ago
2004
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a sub...