3934 search results - page 697 / 787 » Approximate Schedulability Analysis |
152
click to vote
ICONIP
1998
15 years 6 months ago
1998
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
148
click to vote
NC
1998
15 years 6 months ago
1998
Many processes are composed of a n-fold repetition of some simpler process. If the whole process can be modeled with a neural network, we present a method to derive a model of the...
189
click to vote
NETWORKING
2000
15 years 6 months ago
2000
Abstract. The paper deals with tree-structured point-to-multipoint networks, where users from infinite user populations at the leaf nodes subscribe to a variety of channels, offere...
136
click to vote
IJCAI
1997
15 years 6 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
166
click to vote
WSC
1997
15 years 6 months ago
1997
We present a system for describing and solving closed queuing network models of the memory access performance of NUMA architectures. The system consists of a model description lan...