Sciweavers

922 search results - page 44 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
14 years 2 months ago
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
Hongbing Fan, Jiping Liu, Yu-Liang Wu
ICML
1994
IEEE
14 years 1 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer
TCS
2008
13 years 10 months ago
On different generalizations of episturmian words
In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
TNN
2008
106views more  TNN 2008»
13 years 10 months ago
Stability and Hopf Bifurcation of a General Delayed Recurrent Neural Network
In this paper, stability and bifurcation of a general recurrent neural network with multiple time delays is considered, where all the variables of the network can be regarded as bi...
Wenwu Yu, Jinde Cao, Guanrong Chen
JCT
2008
109views more  JCT 2008»
13 years 10 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon