Sciweavers

2074 search results - page 388 / 415
» Using an Object Reference Approach to Distributed Updates
Sort
View
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 1 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
ICS
2004
Tsinghua U.
14 years 22 days ago
Scaling the issue window with look-ahead latency prediction
In contemporary out-of-order superscalar design, high IPC is mainly achieved by exposing high instruction level parallelism (ILP). Scaling issue window size can certainly provide ...
Yongxiang Liu, Anahita Shayesteh, Gokhan Memik, Gl...
ATAL
2006
Springer
13 years 11 months ago
Certified reputation: how an agent can trust a stranger
Current computational trust models are usually built either on an agent's direct experience of an interaction partner (interaction trust) or reports provided by third parties...
Trung Dong Huynh, Nicholas R. Jennings, Nigel R. S...
EKAW
2008
Springer
13 years 9 months ago
An Analysis of the Origin of Ontology Mismatches on the Semantic Web
Despite the potential of domain ontologies to provide consensual representations of domain-relevant knowledge, the open, distributed and decentralized nature of the Semantic Web me...
Paul R. Smart, Paula C. Engelbrecht
PROPERTYTESTING
2010
13 years 5 months ago
Sublinear Algorithms in the External Memory Model
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...