Pages that link to "Item:Q2855323"

The following pages link to International Journal of Computer & Information Sciences (Q2855323):

Displaying 50 items.

• An algorithmic analysis of simulation strategies (Q2855324) (← links)
• A topoiogical formulation of linguistic typology (Q3036722) (← links)
• Exponentiation modulo a polynomial for data security (Q3038618) (← links)
• A state space approach to the finite automata (Q3038626) (← links)
• Approximation of multipath planar shapes in pattern analysis (Q3038646) (← links)
• Computationally efficient algorithms for a one-time pad scheme (Q3038660) (← links)
• Entity-relationship diagrams which are in BCNF (Q3038661) (← links)
• Another view of functional and multivalued dependencies in the relational database model (Q3038662) (← links)
• Application of SQL/N to the attribute-relation associations implicit in functional dependencies (Q3038663) (← links)
• Computing largest empty circles with location constraints (Q3039008) (← links)
• On characteristic sets and degrees of finite automata (Q3048256) (← links)
• An application of learning to robotic planning (Q3049837) (← links)
• OPAL: A new algorithm for optimal partitioning and learning in non parametric unsupervised environments (Q3049838) (← links)
• Learning under a VEDIC teacher (Q3049839) (← links)
• Generalized inverse solutions of multiattribute accounting problems (Q3049850) (← links)
• Development of models of optimal complexity using self-organization theory (Q3049854) (← links)
• Simplification of fuzzy switching functions (Q3206883) (← links)
• Applications of fuzzy algebra to hazard detection in combinational switching circuits (Q3206885) (← links)
• Problems of complex system modeling and applied mathematical statistics (Q3212979) (← links)
• The dynamic clusters method in nonhierarchical clustering (Q3214017) (← links)
• A theory of dynamic file management in a multilevel store (Q3214386) (← links)
• A clique-detection algorithm based on neighborhoods in graphs (Q3214447) (← links)
• An approximation method for solving the sofa problem (Q3215917) (← links)
• The use of hoare logic in the verification of horizontal microprograms (Q3216113) (← links)
• Specification of data restructuring software based on the attribute method (Q3216124) (← links)
• Algorithms for the inverse and a generalization of the state space approach to finite automata (Q3217608) (← links)
• Surjections and coverings (Q3217610) (← links)
• Inferability of context-free programmed grammars (Q3217619) (← links)
• An iterative algorithm for the cyclic Towers of Hanoi problem (Q3219130) (← links)
• Complexity, convexity, and unimodality (Q3219150) (← links)
• Checking similarity of planar figures (Q3219798) (← links)
• CH transform (Q3221355) (← links)
• Concatenated hash code selection (Q3221450) (← links)
• An optimal time and minimal space algorithm for rectangle intersection problems (Q3318126) (← links)
• Safety in grammatical protection systems (Q3319763) (← links)
• Formal restructuring functions for hierarchical data bases (Q3319795) (← links)
• On finding the convex hull of a simple polygon (Q3331831) (← links)
• On game graph structure and its influence on pathology (Q3334108) (← links)
• Binary search trees with binary comparison cost (Q3335002) (← links)
• On?-Languages whose syntactic monoid is trivial (Q3335014) (← links)
• Cellular topology and its applications in image processing (Q3341944) (← links)
• On the method of puzzles for key distribution (Q3342452) (← links)
• A glimpse into the paradise of combinatory algebra (Q3343428) (← links)
• Further remarks for the matrix type-B codes (Q3343915) (← links)
• On the message complexity of distributed problems (Q3345763) (← links)
• Remarks concerning the optimization of matrix codes (Q3657912) (← links)
• Representation of temporal information (Q3657978) (← links)
• A comparative study of 2-3 trees and AVL trees (Q3659162) (← links)
• Regular-like tree expressions (Q3659171) (← links)
• A simple way to near minimization of microprogram control memory (Q3666750) (← links)