3208 search results - page 386 / 642 » A Lower Bound for Primality |
201
click to vote
VL
2000
IEEE
15 years 11 months ago
2000
IEEE
SD2 is a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They augment the systems of Venn-Peirce ...
162
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
167
Voted
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
167
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
177
click to vote
ISPAN
1999
IEEE
15 years 11 months ago
1999
IEEE
Current distributed parallel platforms can provide the resources required to execute a scientific application efficiently. However, when these platforms are shared by multiple use...