DSpace Repository

Browsing by Issue Date

Browsing by Issue Date

Sort by: Order: Results:

  • Karama, Muneer Jebreel (2004)
    In this .a.rticle j we present some important observations of the first 10th Smanmdache Symmtric Numbers
  • J. M. Górriz, C. G. Puntonet, M. Salmerón, J. Ortega, M. Aldasht (IEEE EIS-2004, 29-febrero al 2 de Marzo, Madeira-Portugal., 2004-02-29)
    In this paper we show a Parallel Neural Network (Cross-over Prediction Model) for time series forecasting implemented in PVM (”Parallel Virtual Machine”) and MPI (”Message Passing Interface”), in order to reduce computational ...
  • 5. M. Aldasht, J. Ortega, C. G. Puntonet, A. F. Díaz (IEEE Conference on Evolutionary Computation, Portland, Oregon, 2004-04)
    Evolutionary algorithms provide ways to explore wide search spaces. Thus, it is possible to get some conclusions about the characteristics of these spaces in order to aid in the determination of the best alternatives to ...
  • Aldasht, Mohammed M. M. (Universidad de Granada, PhD Thesis, 2004-07-23)
    El trabajo que se describe en esta memoria se ha centrado en los procedimientos de distribución o equilibrado de carga dinámicos. En la literatura se describen numerosos ejemplos de este tipo de procedimientos cuya eficacia ...
  • Karama, Muneer Jebreel (2005)
    The purpose of this article is to presents 23 Smarandache Identities (SI) (or Facts) with second, three, four, and five degrees. These SI have been obtained by the help of Maple 8(Programming language, see [1]).
  • Karama, Muneer Jebreel (2005)
    The main purpose of this paper is to introduce new concepts of Smarandache numbers, namely Smarandache Friendly Cube Numbers, and give definitions, curious note, theorem, conjectures, proposed future studies, and ask ...
  • Karama, Muneer Jebreel; Karama, Muneer Jebreel (2005)
    The main purpose of this paper is to introduce new concepts of Smarandache numbers, namely Smarandache Sequence of Unhappy Numbers, and give definition, theorem, and ask open problems.
  • Arman, Nabil (6th International Arab Conference on Information Technology (ACIT’2005), 2005)
    The development of efficient algorithms to determine path existence between vertices in a directed graph has attracted a large amount of research efforts due to the important role of these algorithms in many application ...
  • Arman, Nabil (5th International Business Information Management Conference, 2005)
    This article presents an E-Maintenance Management System that was developed at Palestine Polytechnic University. The system was demoed last Spring, as a successful E-Business case study. In this article, the system ...
  • Arman, Nabil (2005 International Conference on Foundations of Computer Science (FCS'05), 2005)
    There are a number of graph representation schemes that have been used in graph algorithms. In this short article, a comparison is conducted among three major representations of directed graphs to illustrate the main ...
  • Rafayah, Mousa; Qutaishat, Munib; Abdallah, Moussa (ELSEVIR, 2005)
    The high incidence of breast cancer in women has increased significantly in the recent years. The most familiar breast tumors types are mass and microcalcification. Mammograms—breast X-ray—are considered the most reliable ...
  • Almasri, Ibrahim; Tonge, Andrew (ELSEVIER/Linear Algebra And Its Applications, 2005)
  • M. Aldasht, J. Ortega, C. G. Puntonet, A. F. Diaz (Jornadas de Paralelismo, Universidad de Granada, Granada, 2005-09-13)
    Los algoritmos evolutivos proporcionan mecanismos para la exploración eficiente de los espacios de diseño. Así, constituyen una herramienta eficaz a la hora de identificar las mejores alternativas para implementar la ...
  • Karama, Muneer Jebreel (2006)
    In [1], C. Ashbacher, studied the Smarandache reverse sequence: 1, 21, 321, 4321, 54321, 654321, 7654321, 87654321, 987654321, 10987654321, 1110987654321,(1) and he checked the first 35 elements and no prime were found. ...
  • Karama, Muneer Jebreel; Karama, Muneer Jebreel (2006)
    In [1] I studied the concept of Smarandache n-expressions, for example I proposed formulas, found solutions, proposed open questions, and conjectured, but all for the fixed 3, and 2 numbers, but what will happen if these ...
  • Arman, Nabil (2006)
    In this study, a comparison is conducted among three major representations of directed graphs to illustrate major advantages and disadvantages of each representation scheme....
  • Unknown author (2006)
    The main purpose of this paper is to introduce new concepts of Smarandache numbers, namely Smarandache Sequence of Unhappy Numbers, and give defin- ition, theorem, and ask open problems.
  • Arman, Nabil (2006)
    Relational Database Schemas represent the database schema as a collection of relation schemas. Sometimes, these relation schemas are poorly designed and need to be decomposed in an attempt to choose "good" relation schemas. ...
  • Arman, Nabil (2006)
    The intelligence of traditional database systems can be improved by recursion. Using recursion, relational database systems are extended into knowledgebase systems (deductive database systems). Linear recursion is the ...
  • Arman, Nabil (2006)
    This paper presents a new approach/algorithm for generating minimum-cost fault-free rule bases, which have no redundancy, circularity, inconsistency, contradiction/conflict and unreachability. The approach makes use of ...

Search DSpace

Browse

My Account