Sciweavers

1132 search results - page 150 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
ICCAD
2000
IEEE
100views Hardware» more  ICCAD 2000»
15 years 10 months ago
Automated Data Dependency Size Estimation with a Partially Fixed Execution Ordering
For data dominated applications, the system level design trajectory should first focus on finding a good data transfer and storage solution. Since no realization details are avail...
Per Gunnar Kjeldsberg, Francky Catthoor, Einar J. ...
VL
2000
IEEE
115views Visual Languages» more  VL 2000»
15 years 10 months ago
SD2: A Sound and Complete Diagrammatic Reasoning System
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 ...
John Howse, Fernando Molina, John Taylor
COCOON
1999
Springer
15 years 10 months ago
On Routing in Circulant Graphs
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...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...
ISPAN
1999
IEEE
15 years 10 months ago
Using Stochastic Intervals to Predict Application Behavior on Contended Resources
Current distributed parallel platforms can provide the resources required to execute a scientific application efficiently. However, when these platforms are shared by multiple use...
Jennifer M. Schopf, Francine Berman
STACS
1999
Springer
15 years 10 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin