Sciweavers

8196 search results - page 192 / 1640
» Computational Modeling and Complexity Science
Sort
View
DAGSTUHL
2008
15 years 8 months ago
The Grand Challenges and Myths of Neural-Symbolic Computation
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
Luís C. Lamb
SIGCSE
2009
ACM
139views Education» more  SIGCSE 2009»
16 years 7 months ago
Abstraction and extensibility in digital logic simulation software
ion and Extensibility in Digital Logic Simulation Software Richard M. Salter and John L. Donaldson Computer Science Department Oberlin College Oberlin, OH 44074 rms@cs.oberlin.edu,...
Richard M. Salter, John L. Donaldson
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 7 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
FUN
2007
Springer
87views Algorithms» more  FUN 2007»
16 years 19 days ago
Knitting for Fun: A Recursive Sweater
In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm th...
Anna Bernasconi, Chiara Bodei, Linda Pagli
CCA
2009
Springer
15 years 11 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich