Sciweavers

1813 search results - page 222 / 363
» Instance Pruning Techniques
Sort
View
JSAT
2006
109views more  JSAT 2006»
15 years 6 months ago
Decomposing SAT Problems into Connected Components
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
Armin Biere, Carsten Sinz
INFORMS
2007
150views more  INFORMS 2007»
15 years 6 months ago
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
— We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlin...
Julián Molina Luque, Manuel Laguna, Rafael ...
IJDAR
2000
60views more  IJDAR 2000»
15 years 6 months ago
Integrated text and line-art extraction from a topographic map
Our proposed approach to text and line-art extraction requires accurately locating a text-string box and identifying external line vectors incident on the box. The results of extra...
Luyang Li, George Nagy, Ashok Samal, Sharad C. Set...
TIT
2002
77views more  TIT 2002»
15 years 6 months ago
Capacity-achieving sequences for the erasure channel
Abstract-- This paper starts a systematic study of capacityachieving sequences of low-density parity-check codes for the erasure channel. We introduce a class Aof analytic function...
P. Oswald, A. Shokrollahi
ASPDAC
2010
ACM
143views Hardware» more  ASPDAC 2010»
15 years 4 months ago
Constrained global scheduling of streaming applications on MPSoCs
Abstract-- We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. Th...
Jun Zhu, Ingo Sander, Axel Jantsch