419 search results - page 17 / 84 » First Order Paths in Ordered Trees |
CN
2004
13 years 8 months ago
2004
The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specif...
CAI
2002
Springer
13 years 8 months ago
2002
Springer
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
EOR
2006
13 years 8 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
ADC
2008
Springer
14 years 2 months ago
2008
Springer
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...