Sciweavers

357 search results - page 16 / 72
» Analysis of Transposition-Table-Driven Work Scheduling in Di...
Sort
View
COORDINATION
2009
Springer
14 years 9 months ago
Multicore Scheduling for Lightweight Communicating Processes
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes
SP
2008
IEEE
117views Security Privacy» more  SP 2008»
14 years 2 months ago
Anonymous Networking with Minimum Latency in Multihop Networks
The problem of security against timing based traffic analysis in multihop networks is considered in this work. In particular, the relationship between the level of anonymity prov...
Parvathinathan Venkitasubramaniam, Lang Tong
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 8 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
SIGIR
2006
ACM
14 years 2 months ago
Distributed query sampling: a quality-conscious approach
We present an adaptive distributed query-sampling framework that is quality-conscious for extracting high-quality text database samples. The framework divides the query-based samp...
James Caverlee, Ling Liu, Joonsoo Bae
CP
2006
Springer
14 years 7 days ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Matthew J. Streeter, Stephen F. Smith