8780 search results - page 1615 / 1756 » On the Feasibility of Consistent Computations |
168
click to vote
AIMS
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we assess the protection mechanisms entered into recent clients to fight against the Sybil attack in KAD, a widely deployed Distributed Hash Table. We study three m...
194
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
175
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
180
click to vote
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detai...
171
click to vote
ICS
2001
Tsinghua U.
15 years 10 months ago
2001
Tsinghua U.
Recent proposals for Chip Multiprocessors (CMPs) advocate speculative, or implicit, threading in which the hardware employs prediction to peel off instruction sequences (i.e., imp...