Sciweavers

9997 search results - page 1917 / 2000
» The case for crowd computing
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 1 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
WMRD
1990
15 years 1 months ago
Replication in Ficus Distributed File Systems
Ficus is a replicated general ling environment for Unix intended to scale to very large nationwide networks. The system employs an optimistic one copy availability" model in ...
Gerald J. Popek, Richard G. Guy, Thomas W. Page Jr...
CICLING
2010
Springer
15 years 1 months ago
Word Length n-Grams for Text Re-use Detection
Abstract. The automatic detection of shared content in written documents –which includes text reuse and its unacknowledged commitment, plagiarism– has become an important probl...
Alberto Barrón-Cedeño, Chiara Basile...
ACMICEC
2007
ACM
220views ECommerce» more  ACMICEC 2007»
15 years 1 months ago
Asymptotically optimal repeated auctions for sponsored search
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
Nicolas S. Lambert, Yoav Shoham
APLAS
2007
ACM
15 years 1 months ago
Scalable Simulation of Cellular Signaling Networks
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
Vincent Danos, Jérôme Feret, Walter F...
« Prev « First page 1917 / 2000 Last » Next »