Sciweavers

28095 search results - page 5508 / 5619
» D
Sort
View
CN
1999
100views more  CN 1999»
15 years 6 months ago
Testing protocols modeled as FSMs with timing parameters
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
M. Ümit Uyar, Mariusz A. Fecko, Adarshpal S. ...
COMPUTER
1999
95views more  COMPUTER 1999»
15 years 6 months ago
Wide-Area Computing: Resource Sharing on a Large Scale
abstract over a complex set of resources and provide a high-level way to share and manage them over the network. To be effective, such a system must address the challenges posed by...
Andrew S. Grimshaw, Adam Ferrari, Frederick Knabe,...
JETAI
2002
57views more  JETAI 2002»
15 years 6 months ago
Contextualizing concepts using a mathematical generalization of the quantum formalism
We outline the rationale and preliminary results of using the State Context Property (SCOP) formalism, originally developed as a generalization of quantum mechanics, to describe t...
Liane Gabora, Diederik Aerts
CPC
1999
105views more  CPC 1999»
15 years 6 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill
JEA
1998
133views more  JEA 1998»
15 years 6 months ago
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...
David R. Helman, Joseph JáJá, David ...
« Prev « First page 5508 / 5619 Last » Next »