Login | Signup | Help
Transparent

Bti92qmxxriv-tiny macro's documents Rss

Folder_24x24 AI

Preview Star_faded

Computer Analysis Of Sprouts

  • Pdf_16x16 22 Pages
  • macro uploaded this 27 days ago
  • 5 views
  • 0 Comments
Preview Star_faded

Joone DTE Guide

One of the biggest problems an user encounters when s/he tries to resolve a complex task using the neural networks, is the difficulty to find a priori a good architecture and the suitable parameters to resolve his own problem. What we need is a system to train in parallel many neural networks using several machines connected to a LAN, in order to try different solutions and be able to find ...
  • Pdf_16x16 24 Pages
  • macro uploaded this 2 months ago
  • 13 views
  • 0 Comments
Preview Star_faded

Joone Complete Guide

Joone (http://www.joone.org/) is a Java framework to build and run AI applications based on neural networks. Joone applications can be built on a local machine, be trained on a distributed environment and run on whatever device.
  • Pdf_16x16 142 Pages
  • macro uploaded this 2 months ago
  • 34 views
  • 0 Comments
Preview Star_faded

Intelligent Search Techniques Proof Number Search

  • Pdf_16x16 97 Pages
  • macro uploaded this 2 months ago
  • 8 views
  • 0 Comments
Preview Star_faded

Lambda Depth-first Proof Number Search and its Application to Go

Thomsen’s λ search and Nagai’s depth-first proofnumber (DFPN) search are two powerful but very different AND/OR tree search algorithms. Lambda Depth-First Proof Number search (LDFPN) is a novel algorithm that combines ideas from both algorithms. λ search can dramatically reduce a search space by finding different levels of threat sequences. DFPN employs the notion of proof and disproof numbers ...
  • Pdf_16x16 6 Pages
  • macro uploaded this 2 months ago
  • 4 views
  • 0 Comments
Preview Star_faded

Df-pn: Depth-first Proof Number Search

  • Openoffice_16x16 16 Pages
  • macro uploaded this 2 months ago
  • 13 views
  • 0 Comments
Preview Star_faded

Checkers Is Solved

The game of checkers has roughly 500 billion billion possible positions (5 × 1020). The task of solving the game, determining the final result in a game with no mistakes made by either player, is daunting. Since 1989, almost continuously, dozens of computers have been working on solving checkers, applying state-of-the-art artificial intelligence techniques to the proving process. This paper a...
  • Pdf_16x16 5 Pages
  • macro uploaded this 2 months ago
  • 28 views
  • 0 Comments
Preview Star_faded

Supporting Online Material for "Checkers Is Solved"

The game of checkers has roughly 500 billion billion possible positions (5 × 1020). The task of solving the game, determining the final result in a game with no mistakes made by either player, is daunting. Since 1989, almost continuously, dozens of computers have been working on solving checkers, applying state-of-the-art artificial intelligence techniques to the proving process. This paper ...
  • Pdf_16x16 13 Pages
  • macro uploaded this 2 months ago
  • 5 views
  • 0 Comments

All Documents

Folders