Sciweavers

2944 search results - page 5 / 589
» Improving Bound Propagation
Sort
View
WCNC
2008
IEEE
13 years 11 months ago
Mitigation of the Propagation of Localization Error Using Multi-Hop Bounding
Abstract—In ad hoc position-location networks, location information is obtained through the sequential estimation of node locations. An unlocalized node can estimate its location...
R. Michael Buehrer, Swaroop Venkatesh, Tao Jia
ASPDAC
2007
ACM
139views Hardware» more  ASPDAC 2007»
13 years 9 months ago
Deeper Bound in BMC by Combining Constant Propagation and Abstraction
ound in BMC by Combining Constant Propagation and Abstraction Roy Armoni, Limor Fix1 , Ranan Fraer1 , Tamir Heyman1,3 , Moshe Vardi2 , Yakir Vizel1 , Yael Zbar1 1 Logic and Validat...
Roy Armoni, Limor Fix, Ranan Fraer, Tamir Heyman, ...
JAIR
2011
123views more  JAIR 2011»
13 years 9 days ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
TIT
2002
146views more  TIT 2002»
13 years 5 months ago
Bounds on the performance of belief propagation decoding
We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-ou...
David Burshtein, Gadi Miller
FLAIRS
2008
13 years 6 months ago
On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization
Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in PseudoBoolean Opti...
Federico Heras, Vasco M. Manquinho, João Ma...