Sciweavers

222 search results - page 20 / 45
» Heuristic Evaluation Functions for General Game Playing
Sort
View
COR
2010
150views more  COR 2010»
13 years 7 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
NETGAMES
2004
ACM
14 years 1 months ago
Zoned federation of game servers: a peer-to-peer approach to scalable multi-player online games
Today’s Multi-player Online Games (MOGs) are challenged by infrastructure requirements, because of their server-centric nature. Peer-to-peer networks are an interesting alternat...
Takuji Iimura, Hiroaki Hazeyama, Youki Kadobayashi
GECCO
2009
Springer
200views Optimization» more  GECCO 2009»
14 years 2 months ago
Apply ant colony optimization to Tetris
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...
Xingguo Chen, Hao Wang, Weiwei Wang, Yinghuan Shi,...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 1 months ago
CGP visits the Santa Fe trail: effects of heuristics on GP
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
Cezary Z. Janikow, Christopher J. Mann
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann