- Experiences with Artificial Intelligence as an Undergraduate Creative Capstone Course
- The Knight's Tour -Evolutionary vs. Depth-First Search
- California State University, Sacramento College of Engineering and Computer Science
- Terrain-Based Genetic Algorithm (TBGA): Modeling Parameter Space as Terrain
- Proceedings of International Joint Conference on Neural Networks, Atlanta, Georgia, USA, June 14-19, 2009 978-1-4244-3553-1/09/$25.00 2009 IEEE
- Self-Splitting Modular Neural Network Domain Partitioning at Boundaries of Trained Regions
- Visualization Tool for a Terrain-Based Genetic Algorithm V. Scott Gordon James Thein
- !!"$#&%'(0)214365879"@AB$CDE5FG% @ H#IP%!RQTS%$CUPV%W(
- A Note on the Performance of Genetic Algorithms on Zero-One Knapsack Problems V. Scott Gordon, A. P. Wim Bohm, and Darrell Whitley
- Computer Science 1 Week 1 CSc 1, Sacramento State Cook / Gordon
- Coyotes, Jazz, and Creative Teams: Facing and Seeking Variance Russ Derickson
- Proceedings of International Joint Conference on Neural Networks, Atlanta, Georgia, USA, June 14-19, 2009 978-1-4244-3553-1/09/$25.00 2009 IEEE
- Vehicle Steering Control Using Modular Neural Networks Michael Olsen Darter V. Scott Gordon
- Evolving Sparse Direction Maps for Maze Pathfinding
- Adaptive Terrain-Based Memetic Algorithms Carlos R. B. Azevedo
- Trappy Minimax -using Iterative Deepening to Identify and Set Traps in Two-Player Games
- Neighbor Annealing for Neural Network Training V. Scott Gordon
- COLLEGE OF ENGINEERING AND COMPUTER SCIENCE Department of Computer Science
- The Behavior Evolving Model and Application of Virtual Robots Suchul Hwang Kyungdal Cho V. Scott Gordon
- X Congresso Brasileiro de Intelig^encia Computacional (CBIC'2011), 8 a 11 de Novembro de 2011, Fortaleza, Ceara c Sociedade Brasileira de Intelig^encia Computacional (SBIC)
- 7.0 Non-Deterministic Finite Automata (NFA) A non-deterministic finite automaton is one that (1) allows multiple arcs with
- 3.0 Lexical Analysis First, let's see a simplified overview of the compilation process
- 5.0 EBNF (Extended BNF) and Syntax Diagrams EBNF is the same as BNF, with three additional meta-symbols
- 6.0 Recursive-Descent Parsing Building a simple recognizer
- 2.0 Formal Grammars -Spring 2012 1 2.0 Formal Grammars
- Minimax Pseudocode CSc 215 Spring 2012 MiniMax(Board)
- 4.0 BNF (Backus-Naur Form) and Parse Trees Consider again the simple grammar shown previously in section 2.0
- Fuzzy Logic Example: Pole-Balancing control system (Luger, 2005)
- page 1 of 2 Getting Started with Fuzzy CLIPS (Spr 2012 CSc-180 Gordon)
- page 1 of 3 CLIPS Expert System shell Class notes CSc-180 S12 -SGordon
- 1.0 Languages, Expressions, Automata -Spring 2012 1 1.0 Languages, Expressions, Automata
