Pages that link to "Item:Q182337"
From MaRDI portal
The following pages link to Journal of Computer Science and Technology (Q182337):
Displaying 50 items.
- \(\rho\) graph: Rendezvous ordering graph for Ada concurrent programs (Q1273083) (← links)
- A new definition of the Hough transform (Q1276440) (← links)
- Element-partition-based methods for visualization of 3D unstructured grid data (Q1276443) (← links)
- Center-distance continuous probability models and the distance measure (Q1276446) (← links)
- Research on the optimal parallel algorithms of broadcast-class problems (Q1276449) (← links)
- A neural network model based on logical operations (Q1276451) (← links)
- The supervised learning Gaussian mixture model (Q1276453) (← links)
- The design and implementation of a distributed shading algorithm (Q1288410) (← links)
- HEWN: A polynomial algorithm for CLIQUE problem (Q1288412) (← links)
- Stream surface construction using mass conservative interpolation (Q1288413) (← links)
- Surface reconstruction with quartic triangular patches (Q1288416) (← links)
- A radial basis function interpolation surface (Q1288417) (← links)
- Design for delay verifiability (Q1288419) (← links)
- A fast method for identifying global feedback lines (Q1288420) (← links)
- Technology mapping and placement for delay-minimization in LUT-based FPGA design (Q1288423) (← links)
- Modification in parameter design (Q1288424) (← links)
- A formalized approach for describing feature-based design methodology (Q1288425) (← links)
- Information system design of manufacturing environments (Q1288427) (← links)
- An analytical delay model (Q1288428) (← links)
- On dependability of computing systems (Q1288429) (← links)
- A syntactic proof of the conservativity of \(\lambda_\omega\) over \(\lambda_2\) (Q1288430) (← links)
- Phase semantics for a pure noncommutative linear propositional logic (Q1288431) (← links)
- Characterizations and algorithms of extensions for CADL and QDL (Q1288432) (← links)
- Deciding quasi-reducibility using witnessed test sets (Q1288435) (← links)
- An efficient parallel graph edge matching algorithm and its applications (Q1288436) (← links)
- A general scheme for formalizing defaults using the predicate \(ab(I,S)\) (Q1288437) (← links)
- Universal abstract consistency class and universal refutation (Q1288438) (← links)
- Decidability of mean value calculus (Q1288439) (← links)
- The twisted-cube connected networks (Q1288440) (← links)
- Multimedia data modeling based on temporal logic and \(XYZ\) system (Q1288442) (← links)
- The mapping synthesis of ternary functions under fixed polarities (Q1312899) (← links)
- An optimal algorithm for solving collision distance between convex polygons in plane (Q1312900) (← links)
- On the problem of optimizing parallel programs for complex memory hierarchies (Q1322382) (← links)
- On GID-testable two-dimensional iterative arrays (Q1322383) (← links)
- Real-time collision-free path planning for robots in configuration space (Q1322386) (← links)
- Automated theorem proving in temporal logic: \(T\)-resolution (Q1322389) (← links)
- An improved bottom-up method for implementing equational programming language (Q1322391) (← links)
- Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques (Q1322394) (← links)
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph (Q1322395) (← links)
- A method for minimization design of two-level-logic networks using multiplexer universal logic modules (Q1322397) (← links)
- A unified algorithm for finding the intersection curve of surfaces (Q1331222) (← links)
- Constructing isosurfaces from 3D data sets taking account of depth sorting of polyhedra (Q1331223) (← links)
- Using timed Petri net to model instruction-level loop scheduling with resource constraints (Q1331226) (← links)
- Generalized resolution and NC-resolution (Q1331227) (← links)
- GLOBAL: A design for random testability algorithm (Q1331229) (← links)
- A distributed algorithm for determining minimal covers of acyclic database schemes (Q1333367) (← links)
- Story parsing grammar (Q1333368) (← links)
- Bottom-up evaluation of datalog with negation (Q1333369) (← links)
- On the relationship between TMS and logic programs (Q1333372) (← links)
- Some results on default logic (Q1333373) (← links)
