Sciweavers

6608 search results - page 985 / 1322
» On the Completeness of Model Checking
Sort
View
CONNECTION
2004
98views more  CONNECTION 2004»
15 years 6 months ago
Self-refreshing memory in artificial neural networks: learning temporal sequences without catastrophic forgetting
While humans forget gradually, highly distributed connectionist networks forget catastrophically: newly learned information often completely erases previously learned information. ...
Bernard Ans, Stephane Rousset, Robert M. French, S...
VISAPP
2008
15 years 8 months ago
Towards the Estimation of Conspicuity with Visual Priors
Traffic signs are designed to be clearly seen by drivers. However a little is known about the visual influence of the traffic sign environment on how it will be perceived. Computer...
Ludovic Simon, Jean-Philippe Tarel, Roland Bremond
CL
2000
Springer
15 years 6 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
CPC
2002
205views more  CPC 2002»
15 years 6 months ago
Convergence Of The Iterated Prisoner's Dilemma Game
Co-learning is a model involving agents from a large population, who interact by playing a fixed game and update their behaviour based on previous experience and the outcome of th...
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...
ET
1998
52views more  ET 1998»
15 years 6 months ago
Scalable Test Generators for High-Speed Datapath Circuits
This paper explores the design of efficient test sets and test-pattern generators for online BIST. The target applications are high-performance, scalable datapath circuits for whi...
Hussain Al-Asaad, John P. Hayes, Brian T. Murray