23590 search results - page 4383 / 4718 » Algorithm Performance Contest |
186
click to vote
SIGCOMM
2004
ACM
16 years 6 days ago
2004
ACM
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often un...
195
click to vote
SPAA
2004
ACM
16 years 6 days ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
224
click to vote
WMASH
2004
ACM
16 years 6 days ago
2004
ACM
With the wide spread growth of mobile computing devices and local area wireless networks, wireless network providers have started to target the users with value-added services bas...
199
click to vote
EMSOFT
2004
Springer
16 years 5 days ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
187
click to vote
ESA
2004
Springer
16 years 5 days ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...