Sciweavers

3131 search results - page 612 / 627
» Generalized connection caching
Sort
View
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 9 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella
IJAC
2000
104views more  IJAC 2000»
13 years 9 months ago
Construction of Self-Distributive Operations and Charged Braids
Starting from a certain monoid that describes the geometry of the left self-distributivity identity, we construct an explicit realization of the free left self-distributive system ...
Patrick Dehornoy
JSA
2000
115views more  JSA 2000»
13 years 9 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
JSYML
2000
103views more  JSYML 2000»
13 years 9 months ago
A Model Complete Theory of Valued D-Fields
The notion of a D-ring, generalizing that of a differential or a difference ring, is introduced. Quantifier elimination and a version of the AxKochen-Ershov principle is proven for...
Thomas Scanlon
GIS
2002
ACM
13 years 9 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...