210 search results - page 27 / 42 » Some Competition Programming Problems as the Beginning of Ar... |
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
ICTAI
2008
IEEE
15 years 3 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
AUSAI
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
ECAI
2000
Springer
15 years 1 months ago
2000
Springer
We address the problem of advice-taking in a given domain, in particular for building a game-playing program. Our approach to solving it strives for the application of machine lea...
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
Genetic programming approaches have previously been employed in the literature to evolve heuristics for various combinatorial optimisation problems. This paper presents a hyper-heu...