Sciweavers

545 search results - page 89 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
TMI
2008
85views more  TMI 2008»
13 years 8 months ago
Sparsity-Enforced Slice-Selective MRI RF Excitation Pulse Design
We introduce a novel algorithm for the design of fast slice-selective spatially-tailored magnetic resonance imaging (MRI) excitation pulses. This method, based on sparse approximat...
Adam C. Zelinski, Lawrence L. Wald, K. Setsompop, ...
EDBT
2008
ACM
128views Database» more  EDBT 2008»
14 years 8 months ago
Processing transitive nearest-neighbor queries in multi-channel access environments
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs...
Xiao Zhang, Wang-Chien Lee, Prasenjit Mitra, Baihu...
PODC
2009
ACM
14 years 9 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
AAMAS
2010
Springer
13 years 8 months ago
Coordinated learning in multiagent MDPs with infinite state-space
Abstract In this paper we address the problem of simultaneous learning and coordination in multiagent Markov decision problems (MMDPs) with infinite state-spaces. We separate this ...
Francisco S. Melo, M. Isabel Ribeiro