Sciweavers

17760 search results - page 288 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
IJCAI
1993
15 years 8 months ago
A New Algorithm for Incremental Prime Implicate Generation
Traditional algorithms for prime implicate generation [Quine, 1952; McCluskey, 1956; Tison, 1967; Kean and Tsiknis, 1990; de Kleer, 1992] require the input formulas to be first tr...
Teow-Hin Ngair
CSL
2010
Springer
15 years 7 months ago
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
Tobias Ganzow, Lukasz Kaiser
GLOBECOM
2007
IEEE
15 years 6 months ago
A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
Adam Panagos, Kurt L. Kosbar
COR
2007
143views more  COR 2007»
15 years 6 months ago
A memetic algorithm for channel assignment in wireless FDMA systems
A new problem encoding is devised for the minimum span frequency assignment problem in wireless communications networks which is compact and general. Using the new encoding, which...
Sung-Soo Kim, Alice E. Smith, Jong-Hyun Lee
CORR
2007
Springer
169views Education» more  CORR 2007»
15 years 6 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...