Results 1 - 10 of 20,171

Table 4. Translation of the region calculus.

in
by Jon G. Rieckebell Laboratories

Table 1. Type system for the region calculus.

in
by Jon G. Rieckebell Laboratories

Table 1: Relations de nable in terms of C 2 The RCC Theory The RCC formalism (Randell et al. 1992) (when I refer to RCC I always refer to the theory presented in that paper) is an axiomatisation of certain spatial concepts and relations in classical 1st-order predicate calculus4. The basic theory assumes just one primitive dyadic relation: C(x; y) read as `x connects with y apos;. Individuals can be interpreted as denoting spatial regions. The C relation is re exive and symmetric, which is ensured by the following two axioms:

in Carving Up Space: Existential Axioms for a Formal Theory of Spatial Regions
by Brandon Bennett 1995
Cited by 4

Table 1. Type system for the region calculus. a0

in Region analysis and the polymorphic lambda calculus
by Anindya Banerjee 1999
Cited by 29

Table 1: Focussing sequent calculus for MANL with constants

in Non-commutative proof construction: a constraint-based approach
by Jean-marc Andreolia, Roberto Maielib, Paul Rueta
"... In PAGE 6: ...2 on, we shall need to explicitly manipulate the elements of the support set, which we shall call places. The inferences of the focussing sequent calculus are presented in Table1 . The present calculus differs slightly from that given in [14] where the entropy rule is implicitly combined with the rules for the tensor connectives, and optimised so as to introduce only the minimal entropy needed by the tensor.... ..."

Table 13: The operators of the computer domain.

in Downward refinement and the efficiency of hierarchical problem solving
by Fahiem Bacchus, Qiang Yang 1994
"... In PAGE 51: ... Similarly, for it to be plugged in the device must be located with the reachofapower outlet. Table13 shows the operators for this domain. For this domain, Alpine generates the graph shown in Figure 10.... ..."
Cited by 5

Table 1: Boundary vs. Connectivity { uniform region sizes

in A New Particle Physics-Based Heuristic for a Euclidean Location-Allocation Problem
by Weidong Caiy, Valentin Spitkovskyz 1998
"... In PAGE 11: ... Up to six decimal places of accuracy are shown. For each version of annealing, the corresponding longest time was taken from Table1 and used as the execution time. The resulting costs are shown in Table 2.... In PAGE 11: ... The resulting costs are shown in Table 2. For example, consider the size-400 row in Table1 . The longest time is 2585.... ..."

Table 1: Boundary vs. Connectivity { uniform region sizes

in Simulated N-Body: New Particle Physics-Based Heuristics for a Euclidean Location-Allocation Problem
by Rahul Simha , Weidong Cai, Valentin Spitkovsky
"... In PAGE 11: ... Up to six decimal places of accuracy are shown. For each version of annealing, the corresponding longest time was taken from Table1 and used as the execution time. The resulting costs are shown in Table 2.... ..."

Table 3: Boundary vs. Connectivity { nonuniform region sizes

in Simulated N-Body: New Particle Physics-Based Heuristics for a Euclidean Location-Allocation Problem
by Rahul Simha , Weidong Cai, Valentin Spitkovsky

Table 2. Experimental results of packet size vs packet reception Connected Region Transitional Region

in Discrete Radio Power Level Consumption Model in Wireless Sensor Networks
by unknown authors
"... In PAGE 5: ... From our experiment we found that when transmit- ting between two nodes on the edge of the connected region, increasing the packet size to greater than 28 bytes decreases the PRR greatly. As shown in Table2 , even when in the con- nected region larger packet sizes have a negative effect on the link quality for those transmissions. From [1] we know that as the packet size increases, the energy per bit of data decreases as the radio startup and overhead costs are shared amongst more data bits.... ..."
Results 1 - 10 of 20,171