139 search results - page 8 / 28 » Internode: Internal Node Logic Computational Model |
VISUAL
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Methods for processing of pictorial queries speci ed by pictorial query trees are presented. Leaves of a pictorial query tree correspond to individual pictorial queries w...
APAL
2007
14 years 11 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
115
click to vote
ENTCS
2007
14 years 11 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
ICDCN
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
112
click to vote
IEEESCC
2005
IEEE
15 years 5 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...