Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Optimal schedules for parallelizing anytime algorithms: the case of independent processes
Eighteenth national conference on Artificial intelligence
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Strategies for Solving SAT in Grids by Randomized Search
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Optimal schedules for parallelizing anytime algorithms: the case of shared resources
Journal of Artificial Intelligence Research
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Partitioning Search Spaces of a Randomized Search
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Restart strategies in optimization: parallel and serial cases
Parallel Computing
Partitioning SAT instances for distributed solving
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Efficiently speeding up sequential computation through the n-way programming model
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Efficient detection of errors in java components using random environment and restarts
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On algorithm portfolios and restart strategies
Operations Research Letters
Partitioning Search Spaces of a Randomized Search
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Designing scalable parallel SAT solvers
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
On Maximum Speedup Ratio of Restart Algorithm Portfolios
INFORMS Journal on Computing
Multiverse: efficiently supporting distributed high-level speculation
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Hi-index | 0.00 |