87 search results - page 15 / 18 » arcs 2004 |
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
111
click to vote
FAST
2004
14 years 11 months ago
2004
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the a...
APN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we define Time Petri Nets with Inhibitor Hyperarcs (IHTPN) as an extension of T-time Petri nets where time is associated with transitions. In this model, ...
CPM
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Phylogenetics is a science of determining connections between groups of organisms in terms of ancestor/descendent relationships, usually expressed by phylogenetic trees, ...
WAIM
2004
Springer
15 years 3 months ago
2004
Springer
Data mining extracts implicit, previously unknown and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most ...