Sciweavers

1837 search results - page 133 / 368
» Abstraction and the C Machine Model
Sort
View
GRAMMARS
2002
116views more  GRAMMARS 2002»
15 years 6 months ago
An Informal Sketch of a Formal Architecture for Construction Grammar
Abstract. A formal architecture for Construction Grammar (CG) is sketched. Modeling domain objects (constructs) are constituent structures with feature structures at the nodes, aka...
Paul Kay
SENSYS
2006
ACM
16 years 13 days ago
Protothreads: simplifying event-driven programming of memory-constrained embedded systems
Event-driven programming is a popular model for writing programs for tiny embedded systems and sensor network nodes. While event-driven programming can keep the memory overhead do...
Adam Dunkels, Oliver Schmidt, Thiemo Voigt, Muneeb...
IPPS
2000
IEEE
15 years 11 months ago
Run-Time Support for Adaptive Load Balancing
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
Milind A. Bhandarkar, Robert Brunner, Laxmikant V....
NIPS
2004
15 years 7 months ago
Maximising Sensitivity in a Spiking Network
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
Anthony J. Bell, Lucas C. Parra
ATVA
2006
Springer
109views Hardware» more  ATVA 2006»
15 years 8 months ago
Proactive Leader Election in Asynchronous Shared Memory Systems
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
M. C. Dharmadeep, K. Gopinath