10608 search results - page 577 / 2122 » Complexity of O'Hara's Algorithm |
167
click to vote
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...
184
click to vote
ICDCS
2007
IEEE
2007
IEEE
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
16 years 1 months ago
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
174
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract--Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) n...
194
click to vote
TCOM
2010
15 years 5 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
189
click to vote
GPEM
2008
15 years 7 months ago
2008
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...