Sciweavers

339 search results - page 1 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
BSL
2004
55views more  BSL 2004»
13 years 5 months ago
Is the Euclidean algorithm optimal among its peers?
Lou van den Dries, Yiannis N. Moschovakis
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
13 years 11 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
Matthias Müller-Hannemann, Siamak Tazari
ICDCSW
2002
IEEE
13 years 10 months ago
Efficient Massive Sharing of Content among Peers
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request r...
Peter Triantafillou, Chryssani Xiruhaki, Manolis K...
ICALP
2003
Springer
13 years 10 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
ICMCS
2008
IEEE
287views Multimedia» more  ICMCS 2008»
13 years 11 months ago
Video transmission scheduling for peer-to-peer live streaming systems
For Internet based video broadcasting applications such as IPTV, the Peer-to-Peer (P2P) streaming scheme has been found to be an effective solution. An important issue in live bro...
Ying Li, Zhu Li, Mung Chiang, A. Robert Calderbank