Sciweavers

4263 search results - page 392 / 853
» Learning without Coding
Sort
View
ALT
1999
Springer
15 years 11 months ago
On the Uniform Learnability of Approximations to Non-Recursive Functions
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
Frank Stephan, Thomas Zeugmann
BIOADIT
2006
Springer
15 years 10 months ago
Attractor Memory with Self-organizing Input
We propose a neural network based autoassociative memory system for unsupervised learning. This system is intended to be an example of how a general information processing architec...
Christopher Johansson, Anders Lansner
AAAI
2010
15 years 8 months ago
Evolving Compiler Heuristics to Manage Communication and Contention
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
Matthew E. Taylor, Katherine E. Coons, Behnam Roba...
GECCO
2008
Springer
178views Optimization» more  GECCO 2008»
15 years 7 months ago
Agent Smith: a real-time game-playing agent for interactive dynamic games
The goal of this project is to develop an agent capable of learning and behaving autonomously and making decisions quickly in a dynamic environment. The agent’s environment is a...
Ryan K. Small
171
Voted
IIE
2007
130views more  IIE 2007»
15 years 6 months ago
An Iterative Methodology for Teaching Object Oriented Concepts
Abstract thinking is a vital skill when learning computer science. Object technology and the concepts it is based upon make this skill even more crucial. However, previous research...
Irit Hadar, Ethan Hadar