Searching for "Of Situations and Their Neighbors." – sorted by Relevance.
-
NeCoMan: Middleware for Safe Distributed Service Deployment in Programmable Networks
- -service model. This model represents a pair of tightly coupled components (not necessarily situated
- Cited by 5 (2 self) – Add To MetaCart
-
Maximum likelihood estimation of phylogenetic tree and substitution rates via generalized neighbor
- . In such situations, the neighbor-joining (NJ) method is frequently used because of its computational speed. The NJ
- Cited by 1 (0 self) – Add To MetaCart
-
Detecting determinism in speech phonemes
- the dynamics [12], because in such a situation, the neighboring trajectories will evolve similarly even for a
- Cited by 2 (2 self) – Add To MetaCart
-
A Mobile Differentiated Services QoS Model
- cell as for Portable Premium Service, but takes also the resource situation in the neighboring cells
- Cited by 2 (2 self) – Add To MetaCart
-
Neighbour finding in images represented by octrees
- . This procedure ignores the situation in which the neighbor may not exist (e.g., when the node is on the border
- Cited by 10 (2 self) – Add To MetaCart
-
Research Statement
- . In such situations, the neighbor-joining (NJ) method is frequently used because of its computational speed. The NJ
- Add To MetaCart
-
Load Balancing for Distributed Branch Bound Algorithms
- of neighbored processors is small enough. To avoid trashing situations that are likely to occur if \Delta
- Cited by 33 (7 self) – Add To MetaCart
-
Solving the traveling salesman problem with a parallel branch-and-bound algorithm on a 1024 processor network
- heapelements is a certain amount higher than on its neighbors. If the local heap situation changes
- Cited by 4 (0 self) – Add To MetaCart
-
Solving the Traveling Salesman Problem with a Distributed Branch-and-Bound Algorithm on a 1024 Processor Network
- on its neighbors. If the local heap situation changes the neighbors will be informed. With this strategy
- Cited by 2 (2 self) – Add To MetaCart
-
New Dynamic Load Balancing Strategy for Efficient Data-Parallel Radiosity Calculations
- either on the local load situation and the load situation of the neighboring processing elements
- Cited by 1 (1 self) – Add To MetaCart

