- The Temporal Knapsack Problem and Its Mark Bartlett1
- Backtracking in Distributed Constraint Networks Youssef Hamadi
- An Overview of the Gridline Project Youssef Hamadi
- Actes JFPC 2009 Subsumption dirige par l'analyse de conflits
- Parallel SAT Solving Youssef Hamadi,
- Diversification and Intensification in Parallel SAT , Youssef Hamadi2,3
- Continuous Search in Constraint Programming Alejandro Arbelaez
- Experiments with Massively Parallel Constraint Solving Lucas Bordeaux, Youssef Hamadi and Horst Samulowitz
- Learning for Dynamic Subsumption Youssef Hamadi1
- Journal on Satisfiability, Boolean Modeling and Computation 6 (2009) 245-262 ManySAT: a Parallel SAT Solver
- Online Heuristic Selection in Constraint Programming Alejandro Arbelaez
- A Generalized Framework for Conflict Analysis G. Audemard1
- Actes JFPC 2008 Vivification de formules propositionnelles clausales
- A SAT-based approach to decipher Gene Regulatory Networks Fabien Corblin1
- Delegation in Tree-search for Distributed Constraint Satisfaction
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
- Boosting Distributed Constraint Satisfaction Georg Ringwelski1
- Multi-Directional Distributed Searches with Aggregation
- June 2, 2006 16:40 WSPC/INSTRUCTION FILE idibtcbjJournal International Journal on Artificial Intelligence Tools
- !"#%$'&)(10"2435$617985()692A@53CBD24EGF HIQPR(TS'UVP WYXa`cb4deXRf`cgihpXRfq'rphps"dcXRfqthpX5uvdc`cgwRx4gyfqWYXQ`eb4qiqigipb4X"x4bhhpqi
- DisCSPs: Tools for generic and efficient multi-agents negotiations Youssef Hamadi
- May 15, 2002 11:57 WSPC/109-IJAIT 00083 International Journal on Artificial Intelligence Tools, Vol. 11, No. 2 (2002) 167188
- Improving Parallel Local Search for SAT Alejandro Arbelaez1
- Interleaved Backtracking in Distributed Constraint Networks Youssef Hamadi
- Knowledge Compilation Properties of Tree-of-BDDs Sathiamoorthy Subbarayan
- Continuous Search in Constraint Programming: An Initial Investigation
- International Conference on Innovative Views of the .Net Technology An Overview of Sangam: A System for Integrating
- Connections and Integration with SAT Solvers: A Survey and a Case Study in Computational
- A Concurrent Portfolio Approach to SMT Christoph M. Wintersteiger1
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
- Control-based Clause Sharing in Parallel SAT Solving
- Cycle-cut decomposition and log-based reconciliation Youssef Hamadi
- Control-based Clause Sharing in Parallel SAT Solving Youssef Hamadi
- Exploiting Weak Dependencies in Tree-based Search Alejandro Arbelaez
- Architectures reconfigurables et traitement de proble`mes NP-difficiles
- Building Portfolios for the Protein Structure Prediction Problem
- Actes JFPC 2007 Expressions Iterees en
- Efficient Combination of Decision Procedures for MUS Computation
- On the First SAT/CP Integration Workshop SAT and CP techniques are two problem solving technologies which share
- Efficiently Solving Quantified Bit-Vector Formulas Christoph M. Wintersteiger
- Actes JFPC 2009 Rordonnancement dynamique bas sur
- DOI: 10.1142/S0218213010000303 International Journal on Artificial Intelligence Tools
- J Heuristics DOI 10.1007/s10732-010-9134-2
- Vivifying Propositional Clausal Formulae Cedric PIETTE1 and Youssef HAMADI2 and Lakhdar SAIS1
- Continuous Resources Allocation in Internet Data Centers Youssef Hamadi
- Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning
- Distributed Log-based Reconciliation Yek Loong Chong1 and Youssef Hamadi2
- Optimizing Architectural and Structural Aspects of Buildings towards Higher Energy Efficiency
- Submitted to: c Y. Hamadi, J. Marques-Silva, and C.M. Wintersteiger
