Sciweavers

92 search results - page 13 / 19
» cp 2007
Sort
View
CP
2007
Springer
15 years 3 months ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
CP
2007
Springer
15 years 3 months ago
A Constraint Store Based on Multivalued Decision Diagrams
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
Henrik Reif Andersen, Tarik Hadzic, John N. Hooker...
CP
2007
Springer
15 years 1 months ago
On Inconsistent Clause-Subsets for Max-SAT Solving
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
NIPS
2007
14 years 11 months ago
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
Ambuj Tewari, Peter L. Bartlett
ICC
2007
IEEE
155views Communications» more  ICC 2007»
15 years 3 months ago
Adaptive Joint Estimation of Symbol Timing and Carrier Frequency Offset for OFDM Systems
Abstract—Synchronization is an important issue in orthogonal frequency-division multiplexing (OFDM) systems including symbol timing and carrier frequency offset (CFO) estimation....
Huiming Wang, Qinye Yin, Yinkuo Meng, Ke Deng