Sciweavers

1176 search results - page 202 / 236
» Implicit Abstraction Heuristics
Sort
View
TIT
2008
122views more  TIT 2008»
15 years 10 days ago
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...
Michael Chertkov, Mikhail G. Stepanov
108
Voted
JCM
2007
105views more  JCM 2007»
15 years 10 days ago
A Flexible Wavelength Converter Placement Scheme for Guaranteed Wavelength Usage
Abstract— Wavelength is one of the most important resources in Wavelength Division Multiplexing(WDM) networks. In optical routing, we are given a set of communication paths (or l...
Can Fang, Chor Ping Low
TON
2008
125views more  TON 2008»
15 years 10 days ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
106
Voted
AAMAS
2002
Springer
15 years 9 days ago
Multiagent Learning for Open Systems: A Study in Opponent Classification
Abstract. Open systems are becoming increasingly important in a variety of distributed, networked computer applications. Their characteristics, such as agent diversity, heterogenei...
Michael Rovatsos, Gerhard Weiß, Marco Wolf
104
Voted
MOC
2000
109views more  MOC 2000»
15 years 7 days ago
A posteriori error estimation and adaptivity for degenerate parabolic problems
Abstract. Two explicit error representation formulas are derived for degenerate parabolic PDEs, which are based on evaluating a parabolic residual in negative norms. The resulting ...
Ricardo H. Nochetto, Alfred Schmidt, C. Verdi