Sciweavers

5183 search results - page 455 / 1037
» The Complexity of Distributions
Sort
View
ATAL
2008
Springer
15 years 9 months ago
Copeland voting: ties matter
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
194
Voted
ATAL
2007
Springer
16 years 1 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
192
Voted
HIPC
2005
Springer
16 years 12 days ago
Scheduling Divisible Loads with Return Messages on Heterogeneous Master-Worker Platforms
Abstract In this paper, we consider the problem of scheduling divisible loads onto an heterogeneous star platform, with both heterogeneous computing and communication resources. We...
Olivier Beaumont, Loris Marchal, Yves Robert
183
Voted
BMCBI
2010
160views more  BMCBI 2010»
15 years 7 months ago
Identification of functional hubs and modules by converting interactome networks into hierarchical ordering of proteins
Background: Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein intera...
Young-Rae Cho, Aidong Zhang
IPPS
2009
IEEE
16 years 1 months ago
Enabling high-performance memory migration for multithreaded applications on LINUX
As the number of cores per machine increases, memory architectures are being redesigned to avoid bus contention and sustain higher throughput needs. The emergence of Non-Uniform M...
Brice Goglin, Nathalie Furmento