DOIAbstract
A parallel algorithm for the set partitioning problem which has applications in the minimization of finite state automata is presented. The algorithm runs on a CREW PRAM in $O(log^2n)z$ time and requires 0(n) processors
A parallel algorithm for the set partitioning problem which has applications in the minimization of finite state automata is presented. The algorithm runs on a CREW PRAM in $O(log^2n)z$ time and requires 0(n) processors
This paper describes a parallel genetic algorithm developed for the solution of the set partitioning...
Abstract. Given a set S of n points in the plane, we consider the problem of partitioning S into two...
The problem of finding the coarsest partition of a set S with respect to another partition of S one ...
A parallel algorithm for the set partitioning problem which has applications in the minimization of ...
We present a minimization algorithm for finite state automata that finds and merges bisimulation-equ...
AbstractIn this paper we present an O(n2) implementation of Moore's algorithm for automata minimizat...
This work deals with two basic operations over finite automata. Determination of nondeterministic fi...
We present a minimization algorithm for non-deterministic finite state automata that finds and merge...
International audienceWe develop a O(m log n)-time and O(k + n + m)-space algorithm for minimizing i...
Abstract. Determinisation of non-deterministic finite automata (NFA) is an impor-tant operation not ...
Determinisation of nondeterministic finite automata is a well-studied problem that plays an importan...
This thesis is concerned with an integer linear programming problem, called the set partitioning pro...
AbstractThe problem of finding the coarsest partition of a set S with respect to another partition o...
We describe a parallel, linear programming and implication based heuristic for solving set partition...
A CRCW PRAM algorithm is presented for computing the coarsest refinement of a partition of a finite ...
This paper describes a parallel genetic algorithm developed for the solution of the set partitioning...
Abstract. Given a set S of n points in the plane, we consider the problem of partitioning S into two...
The problem of finding the coarsest partition of a set S with respect to another partition of S one ...
A parallel algorithm for the set partitioning problem which has applications in the minimization of ...
We present a minimization algorithm for finite state automata that finds and merges bisimulation-equ...
AbstractIn this paper we present an O(n2) implementation of Moore's algorithm for automata minimizat...
This work deals with two basic operations over finite automata. Determination of nondeterministic fi...
We present a minimization algorithm for non-deterministic finite state automata that finds and merge...
International audienceWe develop a O(m log n)-time and O(k + n + m)-space algorithm for minimizing i...
Abstract. Determinisation of non-deterministic finite automata (NFA) is an impor-tant operation not ...
Determinisation of nondeterministic finite automata is a well-studied problem that plays an importan...
This thesis is concerned with an integer linear programming problem, called the set partitioning pro...
AbstractThe problem of finding the coarsest partition of a set S with respect to another partition o...
We describe a parallel, linear programming and implication based heuristic for solving set partition...
A CRCW PRAM algorithm is presented for computing the coarsest refinement of a partition of a finite ...
This paper describes a parallel genetic algorithm developed for the solution of the set partitioning...
Abstract. Given a set S of n points in the plane, we consider the problem of partitioning S into two...
The problem of finding the coarsest partition of a set S with respect to another partition of S one ...
Add to ORKG