Sciweavers

3318 search results - page 214 / 664
» The Weak Instance Model
Sort
View
ACTA
2006
108views more  ACTA 2006»
13 years 8 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
IJON
2007
79views more  IJON 2007»
13 years 8 months ago
Serial interval statistics of spontaneous activity in cortical neurons in vivo and in vitro
Stationary spiking of single neurons is often modelled by a renewal point process. Here, we tested the underlying model assumption that the inter-spike intervals are mutually inde...
Martin P. Nawrot, Clemens Boucsein, Victor Rodrigu...
AML
2002
69views more  AML 2002»
13 years 8 months ago
Transfer principles in nonstandard intuitionistic arithmetic
Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modificat...
J. Avigad, Jeremy Helzner
CN
2000
70views more  CN 2000»
13 years 8 months ago
An efficient algorithm to rank Web resources
How to rank Web resources is critical to Web Resource Discovery (Search Engine). This paper not only points out the weakness of current approaches, but also presents in-depth anal...
Dell Zhang, Yisheng Dong
AI
1999
Springer
13 years 8 months ago
Information Retrieval and Artificial Intelligence
This paper addresses the relations between information retrieval (IR) and AI. It examines document retrieval, summarising its essential features and illustrating the state of its ...
Karen Sparck Jones