Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
Andrew M. Childs, Leonard J. Schulman, Umesh V. Va...
Abstract— Real-world robotic environments are highly structured. The scalability of planning and reasoning methods to cope with complex problems in such environments crucially de...
Requirements for product families are expressed in terms of commonality and variability. This distinction allows early identification of an appropriate software architecture and ...
Andreas Classen, Patrick Heymans, Robin C. Laney, ...
The complex interactions of natural swarms, for example formed by some social insects, are difficult to comprehend. Considering tasks such as nestbuilding, the necessary underlyin...
Sebastian von Mammen, Christian Jacob, Gabriella K...
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...