Sciweavers

88 search results - page 9 / 18
» cp 2008
Sort
View
CP
2009
Springer
14 years 9 months ago
On the Power of Clause-Learning SAT Solvers with Restarts
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
Knot Pipatsrisawat, Adnan Darwiche
ECTEL
2008
Springer
13 years 10 months ago
Evaluation of Interoperability between MOT and Regular Learning Management Systems
Abstract. Adaptive Hypermedia content offers personalization; however, (re)using such material with regular Learning Management Systems (LMS) is not yet straightforward. Ideally, m...
Fawaz Ghali, Alexandra I. Cristea
CONSTRAINTS
2010
153views more  CONSTRAINTS 2010»
13 years 6 months ago
Philosophy of the MiniZinc challenge
MiniZinc arose as a response to the extended discussion at CP2006 of the need for a standard modelling language for CP. This is a challenging problem, and we believe MiniZinc makes...
Peter J. Stuckey, Ralph Becket, Julien Fischer
ICASSP
2008
IEEE
14 years 3 months ago
Blind channel shortening in OFDM system using nulltones and cyclic prefix
This paper considers the problem of blind channel shortening in OFDM systems. Standard OFDM systems use guard interval (GI) in form of cyclic prefix (CP) and nulltones (NT) redun...
Taoufik Ben Jabeur, Karim Abed-Meraim, Hatem Bouje...
CONEXT
2008
ACM
13 years 10 months ago
Advantages of a PCE-based control plane for LISP
The Locator/Identifier Separation Protocol (LISP) is one of the candidate solutions to address the scalability issues in inter-domain routing. The current proposals for its contro...
Alberto Castro, Martín Germán, Xavie...