Sciweavers

1041 search results - page 179 / 209
» Randomizing Reductions of Search Problems
Sort
View
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 11 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
13 years 8 months ago
Fitnessless coevolution
We introduce fitnessless coevolution (FC), a novel method of comparative one-population coevolution. FC plays games between individuals to settle tournaments in the selection pha...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
EC
2008
209views ECommerce» more  EC 2008»
13 years 7 months ago
Human Body Pose Estimation with Particle Swarm Optimisation
In this paper we address the problem of human body pose estimation from still images. A multi-view set of images of a person sitting at a table is acquired and the pose estimated....
Spela Ivekovic, Emanuele Trucco, Yvan R. Petillot
SAC
2008
ACM
13 years 7 months ago
Whom should I trust?: the impact of key figures on cold start recommendations
Generating adequate recommendations for newcomers is a hard problem for a recommender system (RS) due to lack of detailed user profiles and social preference data. Empirical evide...
Patricia Victor, Chris Cornelis, Ankur Teredesai, ...