210 search results - page 5 / 42 » Some Competition Programming Problems as the Beginning of Ar... |
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
14 years 3 months ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
CEC
2009
IEEE
14 years 4 months ago
2009
IEEE
—This paper presents the evolutionary programming with an ensemble of memories to deal with optimization problems in dynamic environments. The proposed algorithm modifies a recen...
AUSAI
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. The much-publicized Netflix competition has put the spotlight on the application domain of collaborative filtering and has sparked interest in machine learning algorithms...
AAAI
2004
13 years 11 months ago
2004
Learning reusable sequences can support the development of expertise in many domains, either by improving decisionmaking quality or decreasing execution speed. This paper introduc...