We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.

Search Results

Showing 81-100 of 131 results
  1. A Shogi Processor with a Field Programmable Gate Array

    In this paper we describe the architecture of a shogi processor based on reconfigurable hardware. For our implementation, we have used Field...
    Youhei Hori, Minenobu Seki, ... Tsutomu Hoshino in Computers and Games
    Conference paper 2001
  2. Learning from Perfection

    Automatic tuning of evaluation function parameters for game playing programs, and automatic discovery of the very features that these parameters...
    Jack van Rijswijck in Computers and Games
    Conference paper 2001
  3. Review: RoboCup through 2000

    Can a team of robots beat the human world champions at soccer? That is the 50-year grand challenge at the heart of the Robotic Soccer World Cup...
    Itsuki Noda, Ian Frank in Computers and Games
    Conference paper 2001
  4. Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs

    Amazons is a young board game with simple rules and a high branching factor, which makes it a suitable test-bed for planning research. This paper...
    Michael Buro in Computers and Games
    Conference paper 2001
  5. Abstract Proof Search

    In complex games with a large branching factor such as Go, programs usually use highly selective search methods, heuristically expanding just a few...
    Tristan Cazenave in Computers and Games
    Conference paper 2001
  6. Selective Register Renaming: A Compiler-Driven Approach to Dynamic Register Renamin

    Dynamic register renaming is a mechanism present in many high performance microprocessors of latest generation aimed at removing false dependencies...
    N. Zingirian, M. Maresca in High-Performance Computing and Networking
    Conference paper 2001
  7. Influence of Compiler Optimizations on Value Prediction

    The practice of speculation in resolving data dependences based on value prediction has been studied as a means of extracting more instruction level...
    Toshinori Sato, Akihiko Hamano, ... Itsujiro Arita in High-Performance Computing and Networking
    Conference paper 2001
  8. A Parallel ADI Method for Linear and Non-linear Equations

    The key goal of the current paper is to implement a parallel alternating-direction implicit, or ADI, method for solving linear and nonlinear...
    Conference paper 2001
  9. Parallelization of the STEM-II Air Quality Model

    STEM-II is an Eulerian numerical model to simulate the behavior of pollutant factors in the air. In this paper the computational requirements of the...
    J. C. Mouriño, D. E. Singh, ... J. D. Bruguera in High-Performance Computing and Networking
    Conference paper 2001
  10. Performance Evaluation of XTP and TCP Transport Protocols for Reliable Multicast Communications

    This article presents a performance evaluation of XTP (Xpress Transport Protocol) and TCP (Transmission Control Protocol) transport protocols for...
    M. A. R. Dantas, G. Jardini in High-Performance Computing and Networking
    Conference paper 2001
  11. Scientific Computation with JavaSpaces

    JavaSpaces provides a simple yet expressive mechanism for distributed computing with commodity technology. We discuss the suitability of JavaSpaces...
    Michael S. Noble, Stoyanka Zlateva in High-Performance Computing and Networking
    Conference paper 2001
  12. Identification and Quantification of Hotspots in Java Grande Programs

    In this paper we present a platform independent analysis of the dynamic profiles of the the Java Grande Forum benchmark suite. A useful platform...
    John Waldron, David Gregg in High-Performance Computing and Networking
    Conference paper 2001
  13. SUPER-SOMA — Solving Tactical Exchanges in Shogi without Tree Searching

    A key feature of programs that play games such as Chess and Shogi is the ability to evaluate the outcome of threatened tactical moves. In Chess this...
    Jeff Rollason in Computers and Games
    Conference paper 2001
  14. Solving Kriegspiel-Like Problems: Examining Efficient Search Methods

    We recently proposed a deterministic approach for solving problems with uncertainty, called the Uncertainty Paradigm. Under this paradigm,...
    Makoto Sakuta, Hiroyuki Iida in Computers and Games
    Conference paper 2001
  15. Construction of Chinese Chess Endgame Databases by Retrograde Analysis

    Retrograde analysis is well-known and has been successfully developed in the design ofWestern chess1 endgame databases. However, there is little...
    Haw-ren Fang, Tsan-sheng Hsu, Shun-chin Hsu in Computers and Games
    Conference paper 2001
  16. Creating Difficult Instances of the Post Correspondence Problem

    Computational aspects of the Post Correspondence Problem (PCP) are studied. Specifically, we describe our efforts to find difficult instances of the...
    Richard J. Lorentz in Computers and Games
    Conference paper 2001
  17. Learning Time Allocation Using Neural Networks

    The strength of a game-playing program is mainly based on the adequacy of the evaluation function and the efficacy of the search algorithm. This...
    Levente Kocsis, Jos Uiterwijk, Jaap van den Herik in Computers and Games
    Conference paper 2001
  18. Physics and Ecology of Rock-Paper-Scissors Game

    From physical and ecological aspects, we reviewan interacting particle system which follows a rule of the Rock-Paper-Scissors (RPS) game. This rule...
    Kei-ichi Tainaka in Computers and Games
    Conference paper 2001
  19. Application-Controlled Coherence Protocols for Scope Consistent Software DSMs

    To use the shared memory programming paradigm in distributed architectures where there is no physically shared memory, an abstraction must be...
    Cicero Roberto de Oliveira Galdino, Alba Cristina Magalhaes Alves de Melo in High-Performance Computing and Networking
    Conference paper 2001
  20. Parallel DEM Simulations of Granular Materials

    Computer simulations of granular materials are often based on the Distinct Element Method (DEM) where each grain is considered individually. Since...
    J.-A. Ferrez, Th. M. Liebling in High-Performance Computing and Networking
    Conference paper 2001
Did you find what you were looking for? Share feedback.