Sciweavers

112 search results - page 12 / 23
» Searching Game Trees in Parallel Using SSS
Sort
View
IPPS
2003
IEEE
15 years 3 months ago
Design and Evaluation of a Parallel HOP Clustering Algorithm for Cosmological Simulation
Clustering, or unsupervised classification, has many uses in fields that depend on grouping results from large amount of data, an example being the N-body cosmological simulation ...
Ying Liu, Wei-keng Liao, Alok N. Choudhary
AAAI
1994
14 years 11 months ago
Evolving Neural Networks to Focus Minimax Search
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
David E. Moriarty, Risto Miikkulainen
SC
2000
ACM
15 years 2 months ago
Parallel Phylogenetic Inference
Recent advances in DNA sequencing technology have created large data sets upon which phylogenetic inference can be performed. However, current research is limited by the prohibiti...
Quinn Snell, Michael Whiting, Mark J. Clement, Dav...
EUROPAR
2003
Springer
15 years 2 months ago
Why Not Use a Pattern-Based Parallel Programming System?
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
John Anvik, Jonathan Schaeffer, Duane Szafron, Kai...
CORR
2012
Springer
229views Education» more  CORR 2012»
13 years 5 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat