Sciweavers

2944 search results - page 408 / 589
» Improving Bound Propagation
Sort
View
COR
2006
98views more  COR 2006»
15 years 6 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
ETT
2006
102views Education» more  ETT 2006»
15 years 6 months ago
Bit-interleaved coded irregular modulation
We consider a simple method to improve the adaptiveness and flexibility of bit-interleaved coded modulation (BICM) for various channel models. With state-of-the art adaptive transm...
Frank Schreckenbach, Gerhard Bauch
IJISTA
2008
95views more  IJISTA 2008»
15 years 6 months ago
Mining manufacturing data using genetic algorithm-based feature set decomposition
Data mining methods can be used for discovering interesting patterns in manufacturing databases. These patterns can be used to improve manufacturing processes. However, data accum...
Lior Rokach
FUIN
2006
139views more  FUIN 2006»
15 years 6 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
CORR
2007
Springer
87views Education» more  CORR 2007»
15 years 6 months ago
Double Sided Watermark Embedding and Detection with Perceptual Analysis
—In our previous work, we introduced a double-sided technique that utilizes but not reject the host interference. Due to its nice property of utilizing but not rejecting the host...
Jidong Zhong, Shangteng Huang