4781 search results - page 42 / 957 » Complexity at large |
DSD
2010
IEEE
13 years 7 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
IMA
1995
Springer
13 years 11 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
ICNC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Small populations are very desirable for reducing the required computational resources in evolutionary optimization of complex real-world problems. Unfortunately, the sea...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...