Sciweavers

2924 search results - page 312 / 585
» Lower Bounds in Distributed Computing
Sort
View
IJCAI
2007
15 years 5 months ago
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 3 months ago
On Outage and Error Rate Analysis of the Ordered V-BLAST
Outage and error rate performance of the ordered BLAST with more than 2 transmit antennas is evaluated for i.i.d. Rayleigh fading channels. A number of lower and upper bounds on th...
Sergey Loyka, François Gagnon
PODC
2005
ACM
15 years 10 months ago
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
ICDE
2012
IEEE
223views Database» more  ICDE 2012»
13 years 7 months ago
Incremental Detection of Inconsistencies in Distributed Data
—This paper investigates the problem of incremental detection of errors in distributed data. Given a distributed database D, a set Σ of conditional functional dependencies (CFDs...
Wenfei Fan, Jianzhong Li, Nan Tang, Wenyuan Yu
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 4 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang