Sciweavers

1331 search results - page 166 / 267
» Complexity bounds for zero-test algorithms
Sort
View
CODES
2006
IEEE
15 years 5 months ago
Efficient computation of buffer capacities for multi-rate real-time systems with back-pressure
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...
Maarten Wiggers, Marco Bekooij, Pierre G. Jansen, ...
GPEM
2008
98views more  GPEM 2008»
15 years 3 months ago
Sporadic model building for efficiency enhancement of the hierarchical BOA
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...
Martin Pelikan, Kumara Sastry, David E. Goldberg
128
Voted
ICC
2007
IEEE
15 years 9 months ago
Statistical Pruning for Near Maximum Likelihood Detection of MIMO Systems
Abstract— We show a statistical pruning approach for maximum likelihood (ML) detection of multiple-input multiple-output (MIMO) systems. We present a general pruning strategy for...
Tao Cui, Tracey Ho, Chintha Tellambura
DEXAW
2006
IEEE
139views Database» more  DEXAW 2006»
15 years 5 months ago
Consistent Query Answering By Minimal-Size Repairs
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...
Andrei Lopatenko, Leopoldo E. Bertossi
IANDC
2007
117views more  IANDC 2007»
15 years 3 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis