4526 search results - page 119 / 906 » Algorithmic problems related to the Internet |
160
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
139
click to vote
TCSV
2010
14 years 10 months ago
2010
Abstract--Peer-to-peer (P2P) video-on-demand (VoD) is a popular Internet service for a large number of concurrent users. Streaming capacity in a P2P VoD system is defined as the ma...
107
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Recent large scale experiments have shown that the Normalized Information Distance, an algorithmic information measure, is among the best similarity metrics for melody classiï¬...
159
click to vote
MST
2008
15 years 4 months ago
2008
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
ALGORITHMICA
2010
15 years 4 months ago
2010
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...