Sciweavers

4843 search results - page 575 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
127
Voted
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 3 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...
PODC
2009
ACM
16 years 5 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...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 5 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
133
Voted
AAMAS
2010
Springer
15 years 5 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
EC
2011
240views ECommerce» more  EC 2011»
14 years 11 months ago
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
Johannes Bader, Eckart Zitzler