Sciweavers

19320 search results - page 8 / 3864
» On the complexity of computing determinants
Sort
View
ICMAS
2000
15 years 1 months ago
Integer Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
Arne Andersson, Mattias Tenhunen, Fredrik Ygge
134
Voted
PERCOM
2005
ACM
16 years 1 days ago
Determination of Time and Order for Event-Based Middleware in Mobile Peer-to-Peer Environments
An event correlation is becoming an important service in event-based middleware allowing subscribers in publish/subscribe paradigm to consume patterns of events (composite events)...
Eiko Yoneki, Jean Bacon
ECCC
2011
234views ECommerce» more  ECCC 2011»
14 years 7 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan
AAMAS
2012
Springer
13 years 8 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
ICDCS
2009
IEEE
15 years 9 months ago
Modeling Probabilistic Measurement Correlations for Problem Determination in Large-Scale Distributed Systems
With the growing complexity in computer systems, it has been a real challenge to detect and diagnose problems in today’s large-scale distributed systems. Usually, the correlatio...
Jing Gao, Guofei Jiang, Haifeng Chen, Jiawei Han