Investigating Monte-Carlo Methods on the Weak Schur Problem

No abstract is available for this paper.

• Publication year

  2013

• Venue

  EvoCOP

• Publication date

  2013-04-03

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-37198-1_17
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Current state and future trends: a citation network analysis of the learning analytics field

  2014cited by this paper
• Weak Schur numbers and the search for G.W. Walker's lost partitions

  2012cited by this paper
• Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows

  2012cited by this paper
• From Streamlined Combinatorial Search to Efficient Constructive Procedures

  2012influential reference
• Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows

  2011cited by this paper
• A Multilevel Tabu Search with Backtracking for Exploring Weak Schur Numbers

  2011cited by this paper
• Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search

  2010cited by this paper
• Biasing Monte-Carlo Simulations through RAVE Values

  2010cited by this paper
• Parallel Nested Monte-Carlo search

  2009cited by this paper
• The Last-Good-Reply Policy for Monte-Carlo Go

  2009cited by this paper
• Bounds on some van der Waerden numbers

  2008cited by this paper
• Combining online and offline knowledge in UCT

  2007cited by this paper
• PARTITIONS INTO SUM-FREE SETS

  2006cited by this paper
• Spectral learning

  2003cited by this paper
• On an extension of a theorem of Schur

  2002cited by this paper
• Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers

  2000cited by this paper
• Artificial Evolution

  2000cited by this paper
• Computers and Games

  1999cited by this paper
• A problem of Schur and its generalizations

  1972influential reference
• Some Solved and Unsolved Problems in the Theory of Numbers

  1941cited by this paper
• Über Kongruenz x ... (mod. p.).

  year unknowncited by this paper
• Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Nested Rollout Policy Adaptation for Monte Carlo Tree Search

  year unknowninfluential reference

• Adaptive Bias Generalized Rollout Policy Adaptation on the Flexible Job-Shop Scheduling Problem

  2025cites this paper
• Exact values and lower bounds on the n-color weak Schur numbers for n=2,3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document

  2023cites this paper
• New lower bounds for Schur and weak Schur numbers

  2021cites this paper
• Burnt Pancake Problem: New Lower Bounds on the Diameter and New Experimental Optimality Ratios

  2021cites this paper
• Parallel Nested Rollout Policy Adaptation

  2019cites this paper
• On the n-Color Weak Rado Numbers for the Equation

  2019cites this paper
• A general lower bound on the weak Schur number

  2018cites this paper
• A lower bound for weak Schur numbers with a deterministic algorithm

  2018cites this paper
• Local Search, data structures and Monte Carlo Search for Multi-Objective Combinatorial Optimization Problems. (Recherche Locale, structures de données et Recherche Monte-Carlo pour les problèmes d'optimisation combinatoire Multi-Objectif)

  2017cites this paper
• Lower Bounds on the Weak Schur Numbers Up to 9 Colors

  2017cites this paper
• Nested Rollout Policy Adaptation with Selective Policies

  2016cites this paper
• An Abstract Procedure to Compute Weak Schur Number Lower Bounds

  2015influential citation
• An Experimental Investigation on the Pancake Problem

  2015cites this paper
• Forecasting Financial Volatility Using Nested Monte Carlo Expression Discovery

  2015cites this paper
• An experimental study of adaptive control for evolutionary algorithms

  2014cites this paper