Sciweavers

10054 search results - page 197 / 2011
» On the Complexity of Function Learning
Sort
View
97
Voted
ICALT
2005
IEEE
15 years 6 months ago
Learning Units Design Based in Grid Computing
: The development of cooperative, flexible and reusable learning environments is a need in modern education. The IMS Learning Design specification has played a very important role ...
Leonel Iriarte Navarro, Manuel Marco Such, Alexand...
STACS
1999
Springer
15 years 5 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
214
Voted
POPL
2009
ACM
16 years 1 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
14 years 11 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
ICANNGA
2009
Springer
203views Algorithms» more  ICANNGA 2009»
15 years 7 months ago
NEAT in HyperNEAT Substituted with Genetic Programming
In this paper we present application of genetic programming (GP) [1] to evolution of indirect encoding of neural network weights. We compare usage of original HyperNEAT algorithm w...
Zdenek Buk, Jan Koutník, Miroslav Snorek