Sciweavers

4372 search results - page 546 / 875
» Algorithmic Theories of Everything
Sort
View
INFOCOM
2009
IEEE
16 years 2 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
INFOCOM
2009
IEEE
16 years 2 months ago
Keep Cache Replacement Simple in Peer-Assisted VoD Systems
—Peer-assisted Video-on-Demand (VoD) systems have not only received substantial recent research attention, but also been implemented and deployed with success in large-scale real...
Jiahua Wu, Baochun Li
GECCO
2009
Springer
16 years 2 months ago
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
Philipp Rohlfshagen, Per Kristian Lehre, Xin Yao
COMPGEOM
2009
ACM
16 years 2 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 1 months 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