14699 search results - page 398 / 2940 » Complexity and Cognitive Computing |
169
click to vote
TAMC
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
110
Voted
ISMVL
2005
IEEE
15 years 10 months ago
2005
IEEE
In digital signal processing, we often use higher radix system to achieve high-speed computation. In such cases, we require radix converters. This paper considers the design of LU...
110
click to vote
DSD
2002
IEEE
15 years 10 months ago
2002
IEEE
We use a formal tool to extract Finite State Machines (FSM) based representations (lists of states and transitions) of sequential circuits described by flip-flops and gates. The...
139
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
155
click to vote
IJFCS
2008
15 years 5 months ago
2008
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event s...