AbstractIn this paper, a new approach, which is based on function decomposition, is proposed for deriving algorithms on processor arrays with reconfigurable bus systems. The effectiveness of this approach is shown through some important applications. They include computing the logical exclusive-OR of n bits, summing n bits, summing n m-bit binary integers, and multiplying two n-bit binary integers. All these applications are solved in O(1) time
International audienceIn this paper, we introduce a constraint programming-based approach for optimi...
International audienceIn this paper, we introduce a constraint programming- based approach for the o...
The all pairs shortest path problem is a class of the algebraic path problem. Many parallel algorith...
[[abstract]]In this paper, a new approach, which is based on function decomposition, is proposed for...
AbstractIn this paper, a new approach, which is based on function decomposition, is proposed for der...
[[abstract]]A reconfigurable bus system is a bus system whose configuration is dynamically changeabl...
[[abstract]]The power of a computation model usually indicates how fast a problem can be solved unde...
This paper presents algorithms that allow the realization of multi-valued functions as a multi-level...
[[abstract]]A processor array with a reconfigurable bus system (abbreviated to PARBS) is a computati...
This paper presents a formalism for describing the behavior of computational networks at the algori...
In this paper, we will begin with an overview of functional decomposition algorithms based on differ...
In this paper, we will begin with an overview of functional decomposition algorithms based on differ...
International audienceIn this paper, we introduce a constraint programming-based approach for optimi...
International audienceIn this paper, we introduce a constraint programming-based approach for optimi...
The Reconfigurable Array with Spanning Optical Buses (RASOB) has recently received a lot of attentio...
International audienceIn this paper, we introduce a constraint programming-based approach for optimi...
International audienceIn this paper, we introduce a constraint programming- based approach for the o...
The all pairs shortest path problem is a class of the algebraic path problem. Many parallel algorith...
[[abstract]]In this paper, a new approach, which is based on function decomposition, is proposed for...
AbstractIn this paper, a new approach, which is based on function decomposition, is proposed for der...
[[abstract]]A reconfigurable bus system is a bus system whose configuration is dynamically changeabl...
[[abstract]]The power of a computation model usually indicates how fast a problem can be solved unde...
This paper presents algorithms that allow the realization of multi-valued functions as a multi-level...
[[abstract]]A processor array with a reconfigurable bus system (abbreviated to PARBS) is a computati...
This paper presents a formalism for describing the behavior of computational networks at the algori...
In this paper, we will begin with an overview of functional decomposition algorithms based on differ...
In this paper, we will begin with an overview of functional decomposition algorithms based on differ...
International audienceIn this paper, we introduce a constraint programming-based approach for optimi...
International audienceIn this paper, we introduce a constraint programming-based approach for optimi...
The Reconfigurable Array with Spanning Optical Buses (RASOB) has recently received a lot of attentio...
International audienceIn this paper, we introduce a constraint programming-based approach for optimi...
International audienceIn this paper, we introduce a constraint programming- based approach for the o...
The all pairs shortest path problem is a class of the algebraic path problem. Many parallel algorith...