Experimental evaluation of modern variable selection strategies in Constraint Satisfaction Problems Thanasis Balafoutis1 and Kostas Stergiou1 Department of Information - Local consistency - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2008-12-16 11:04:51 Constraint programming Operations research Constraint satisfaction problem Local consistency Mathematical optimization Heuristic Integer programming Constraint satisfaction Search algorithm Local search Look-ahead Decomposition method		Experimental evaluation of modern variable selection strategies in Constraint Satisfaction Problems Thanasis Balafoutis1 and Kostas Stergiou1 Department of Information & Communication Systems Engineering University of th Add to Reading List Source URL: tmancini.di.uniroma1.it Download Document from Source Website File Size: 203,57 KB Share Document on Facebook

	Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm DocID: 1vdZY - View Document
	Information Processing Letters–229 www.elsevier.com/locate/ipl Salembier’s Min-tree algorithm turned into breadth first search Wim H. Hesselink Department of Mathematics and Computing Science, Rijksuniv DocID: 1uX4F - View Document
	WP‐1023 Rev. 05.08 SHERPA – An Efficient and Robust Optimization/Search Algorithm Introduction Numerical design optimization is now an industry‐ DocID: 1uNJ3 - View Document
	Searching BWT compressed text with the Boyer-Moore algorithm and binary search Tim Bell1 Matt Powell1 DocID: 1uCWS - View Document
	EE365: Informed Search 1 Dijkstra’s algorithm vs = 0 DocID: 1uuM7 - View Document