Sciweavers

5964 search results - page 428 / 1193
» A theory of speculative computation
Sort
View
ACTA
2006
108views more  ACTA 2006»
15 years 7 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
AI
2006
Springer
15 years 7 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
ENTCS
2006
113views more  ENTCS 2006»
15 years 7 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
RAS
2006
170views more  RAS 2006»
15 years 7 months ago
Hierarchical attentive multiple models for execution and recognition of actions
According to the motor theories of perception, the motor systems of an observer are actively involved in the perception of actions when these are performed by a demonstrator. In t...
Yiannis Demiris, Bassam Khadhouri
BC
2005
122views more  BC 2005»
15 years 7 months ago
On partial contraction analysis for coupled nonlinear oscillators
We describe a simple but general method to analyze networks of coupled identical nonlinear oscillators, and study applications to fast synchronization, locomotion, and schooling. ...
Wei Wang 0008, Jean-Jacques E. Slotine