Found 97029 papers in total
A review of Group Decision Support Systems
1991,
A series of articles is planned in the next few issues of OR Insight covering aspects of Group Decision...
A paradigmatic analysis of contemporary schools of IS development
1991,
This paper presents the results of the fundamental assumptions of seven major schools of thought in IS...
Problems with strategic information systems frameworks
1991,
In the mid 1980s a number of frameworks appeared for analysing information systems from a strategic...
The application of an expert system shell to an unstructured domain of expertise: Using expert system technology to teach SSM
1991,
Action research is orchestrated by the interaction between theory and practice as exemplified by soft...
A learning rule-based control system
1992,
In this paper the concepts of knowledge acquisition and learning are reviewed and combined to build a...
The question of biased dices
1991,
How is it possible to bias two equal dice in such a way that the maximum probability of the sum of the...
Selection of relaxation problems for a class of asymmetric traveling salesman problem instances
1991,
It is commonly believed that the use of the assignment problem works well when one selects a relaxation...
q-functional equations and some partition identities
1991,
The paper uses q -functional equations to prove some ( n+t) -color partition identities. Generating...
Generalized flags in finite Abelian p-groups
1991,
For each partition λ of n , let LÅλ=LÅλ(p) be the lattice of subgroups of...
Brick tabloids and the connection matrices between bases of symmetric functions
1991,
Let H n denote the space of symmetric functions, homogeneous of degree n . This paper introduces a new set...
Some applications of algebra to combinatorics
1991,
This paper is based on lectures and provides a tutorial guide to the use of set theory in combinatorics.
Certain Boolean equations
1992,
In a previous paper, two theorems are given related to the number of parameters of the solution of the...
A greedy reduction algorithm for setup optimization
1992,
A reduction algorithm for setup optimization in general ordered sets is proposed. Moreover, the class of...
Linear sections of the general linear group: A geometric approach
1992,
This paper investigates the subset •(n,q) of the general linear group Gl( n+1 ) consisting of...
Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice
1991,
Let , , be the number of chains (totally ordered sets) of length i contained in a finite distributive...
La queste del saint Gra(AL): A computational approach to local algebra
1991,
The paper shows how, by means of the Tangent Cone Algorithm, the basic functions related to the maximal...
On Bayer’s deformation and the associativity formula
1991,
A usual technique in computational commutative algebra is to reduce the computation of invariants of...
Constructive complexity
1991,
Powerful and widely applicable, yet inherently nonconstructive, tools have recently become available for...
On doing Todd-Coxeter coset enumeration in parallel
1991,
The Todd-Coxeter coset enumeration method is without any doubt the best known and most used method in...
Semigroup automaton structure by homomorphism and domain partition
1991,
The problem of deciding if a given function of the set of states of a finite automation A belongs to its...
An introduction to randomized algorithms
1991,
Research conducted over the past fifteen years has amply demonstrated the advantages of algorithms that...
Improved bounds for harmonic-based bin packing algorithms
1991,
The modified harmonic bin packing algorithm, and Hu and Kahng’s unnamed algorithm, are variations of...
On the spectra of sums of orthogonal projections with applications to parallel computing
1991,
Many parallel iterative algorithms for solving symmetric, positive definite problems proceed by solving in...
Calculating growth rates and moments for additive cellular automata
1992,
Suppose that the cellular automation F is the graph of an additive rule modulo p. It is shown how to...
Papers per page:

Paper Filter