Sciweavers

9997 search results - page 1639 / 2000
» The case for crowd computing
Sort
View
CORR
2006
Springer
154views Education» more  CORR 2006»
15 years 6 months ago
How Hard Is Bribery in Elections?
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
DEBU
2006
142views more  DEBU 2006»
15 years 6 months ago
Automated Storage Management with QoS Guarantee in Large-scale Virtualized Storage Systems
Storage virtualization in modern storage systems allows variability in the number of "physical" disks supporting a single "virtual" disk. In practice, IO workl...
Lin Qiao, Balakrishna R. Iyer, Divyakant Agrawal, ...
ECCC
2006
99views more  ECCC 2006»
15 years 6 months ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
IJAR
2008
95views more  IJAR 2008»
15 years 6 months ago
Complexity results for enhanced qualitative probabilistic networks
While quantitative probabilistic networks (QPNs) allow the expert to state influences between nodes in the network as influence signs, rather than conditional probabilities, infer...
Johan Kwisthout, Gerard Tel
EOR
2006
66views more  EOR 2006»
15 years 6 months ago
Using intervals for global sensitivity and worst-case analyses in multiattribute value trees
Sensitivity analyses have long been used to assess the impacts of uncertainties on outcomes of decision models. Several approaches have been suggested, but it has been problematic...
Jyri Mustajoki, Raimo P. Hämäläinen...
« Prev « First page 1639 / 2000 Last » Next »