Sciweavers

2316 search results - page 65 / 464
» The many forms of hypercomputation
Sort
View
ICONIP
1998
15 years 7 months ago
Computing Iterative Roots with Neural Networks
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
Lars Kindermann
VL
2008
IEEE
171views Visual Languages» more  VL 2008»
16 years 11 days ago
Usability challenges for enterprise service-oriented architecture APIs
An important part of many programming tasks is the use of libraries and other forms of Application Programming Interfaces (APIs). Programming via web services using a Service-Orie...
Jack Beaton, Sae Young Jeong, Yingyu Xie, Jeffrey ...
APCSAC
2005
IEEE
15 years 11 months ago
A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up...
Zhang Xinhua, Peter Loh
EVOW
1994
Springer
15 years 10 months ago
Genetic Approaches to Learning Recursive Relations
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...
Peter A. Whigham, Robert I. McKay
ICDT
1990
ACM
110views Database» more  ICDT 1990»
15 years 10 months ago
Beginnings of a Theory of General Database Completions
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
Stefan Brass