Sciweavers

IJCM
2002
73views more  IJCM 2002»
14 years 7 days ago
Space-Time Equations for Non-Unimodular Mappings
Abstract. The class of systems of uniform recurrence equations (UREs) is closed under unimodular transformations. As a result, every systolic array described by a unimodular mappin...
Jingling Xue, Patrick M. Lenders
IJCM
2002
42views more  IJCM 2002»
14 years 7 days ago
On-Line Approximate String Searching Algorithms: Survey and Experimental Results
Panagiotis D. Michailidis, Konstantinos G. Margari...
IJCM
2002
68views more  IJCM 2002»
14 years 7 days ago
Computing an Optimal Hatching Direction in Layered Manufacturing
In Layered Manufacturing (LM), a prototype of a virtual polyhedral object is built by slicing the object into polygonal layers, and then building the layers one after another. In ...
Jörg Schwerdt, Michiel H. M. Smid, Man Chung ...
IJCM
2002
33views more  IJCM 2002»
14 years 7 days ago
Product of Finite Maximal P-Codes
Dongyang Long, Weijia Jia, Liang Zhang
IJCM
2002
43views more  IJCM 2002»
14 years 7 days ago
A Robust Algorithm for Solving Nonlinear Programming Problems
Yan Li, Lishan Kang, Hugo de Garis, Zhuo Kang, Pu ...
IJCM
2002
84views more  IJCM 2002»
14 years 7 days ago
A Two-Stage Iterative Method for Solving a Weakly Nonlinear Parametrized System
In this paper we consider a parametrized system of weakly nonlinear equations which corresponds to a nonlinear elliptic boundary
Emanuele Galligani
IJCM
2002
83views more  IJCM 2002»
14 years 7 days ago
A Radio Coloring of a Hypercube
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
Ophir Frieder, Frank Harary, Peng-Jun Wan
IJCM
2002
97views more  IJCM 2002»
14 years 7 days ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...
IJCM
2002
41views more  IJCM 2002»
14 years 7 days ago
An Experimental Study of Benchmarking Functions for Genetic Algorithms
Jason G. Digalakis, Konstantinos G. Margaritis
IJCM
2002
92views more  IJCM 2002»
14 years 7 days ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo