Sciweavers

208 search results - page 38 / 42
» A New Direction in AI - Toward a Computational Theory of Per...
Sort
View
ACL
1994
13 years 8 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
GECCO
2008
Springer
196views Optimization» more  GECCO 2008»
13 years 8 months ago
ADANN: automatic design of artificial neural networks
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
Juan Peralta, Germán Gutiérrez, Arac...
OOPSLA
2005
Springer
14 years 1 months ago
Adding trace matching with free variables to AspectJ
An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspec...
Chris Allan, Pavel Avgustinov, Aske Simon Christen...
PDC
2004
ACM
14 years 29 days ago
Lost in translation: a critical analysis of actors, artifacts, agendas, and arenas in participatory design
As computer technologies start to permeate the everyday activities of a continuously growing population, social and technical as well as political and legal issues will surface. P...
Rogério De Paula
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei