Sciweavers

5995 search results - page 877 / 1199
» Algorithmic Game Theory
Sort
View
COMPGEOM
2009
ACM
16 years 1 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
16 years 26 days ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
16 years 26 days ago
Interactive evolution of XUL user interfaces
We attack the problem of user fatigue by using an interactive genetic algorithm to evolve user interfaces in the XUL interface definition language. The interactive genetic algori...
Juan C. Quiroz, Sushil J. Louis, Sergiu M. Dascalu
IPSN
2007
Springer
16 years 25 days ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao
PODC
2005
ACM
16 years 7 days ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer