12264 search results - page 60 / 2453 » An Analysis of the XSL Algorithm |
133
click to vote
SODA
1993
ACM
15 years 5 months ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
124
click to vote
IPL
2008
15 years 4 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
119
click to vote
RSA
2006
15 years 4 months ago
2006
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
116
click to vote
SIGMETRICS
1987
ACM
15 years 8 months ago
1987
ACM
Expressions are found for the throughput and delay performance of a Tree Conflict Resolution Algorithm that is used in a Local Area Network with carrier sensing (and possibly also ...
114
click to vote
TSP
2008
15 years 4 months ago
2008
Timing synchronization is a critical challenge in ultra-wideband impulse radios (UWB-IRs). Conventional fulldigital synchronization methods encounter implementation difficulties su...