Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
Formal Models of Heavy-Tailed Behavior in Combinatorial Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Restart Policies with Dependence among Runs: A Dynamic Programming Approach
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Eighteenth national conference on Artificial intelligence
Optimal schedules for parallelizing anytime algorithms: the case of independent processes
Eighteenth national conference on Artificial intelligence
Search Strategies for Hybrid Search Spaces
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
The Knowledge Engineering Review
Discrete Applied Mathematics
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
Parallel and distributed local search in COMET
Computers and Operations Research
Instance-Based Selection of Policies for SAT Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Problem-Sensitive Restart Heuristics for the DPLL Procedure
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Low-knowledge algorithm control
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Disco - Novo - GoGo: integrating local search and complete search with restarts
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Efficient Multi-start Strategies for Local Search Algorithms
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Restart schedules for ensembles of problem instances
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Optimal schedules for parallelizing anytime algorithms: the case of shared resources
Journal of Artificial Intelligence Research
Solution-guided multi-point constructive search for job shop scheduling
Journal of Artificial Intelligence Research
Provably bounded-optimal agents
Journal of Artificial Intelligence Research
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The effect of restarts on the efficiency of clause learning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
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
Clasp: a conflict-driven answer set solver
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
On universal restart strategies for backtracking search
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Fitness-distance correlation and solution-guided multi-point constructive search for CSPs
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A hybrid constraint programming/local search approach to the job-shop scheduling problem
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Adaptive restart strategies for conflict driven SAT solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
On the use of different types of knowledge in metaheuristics based on constructing solutions
Engineering Applications of Artificial Intelligence
Restart strategies in optimization: parallel and serial cases
Parallel Computing
On the power of clause-learning SAT solvers as resolution engines
Artificial Intelligence
Partitioning SAT instances for distributed solving
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Combining Constraint Programming and Local Search for Job-Shop Scheduling
INFORMS Journal on Computing
Understanding the behavior of Solution-Guided Search for job-shop scheduling
Journal of Scheduling
Improving CP-based local branching via sliced neighborhood search
Proceedings of the 2011 ACM Symposium on Applied Computing
Learning cluster-based structure to solve constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming
Transportation Science
Empirical study of the anatomy of modern sat solvers
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Randomized backtracking in state space traversal
Proceedings of the 18th international SPIN conference on Model checking software
Stochastic search with locally clustered targets: learning from T cells
ICARIS'11 Proceedings of the 10th international conference on Artificial immune systems
Grid-based SAT solving with iterative partitioning and clause learning
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Synthesizing small and reliable tile sets for patterned DNA self-assembly
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Efficient multi-start strategies for local search algorithms
Journal of Artificial Intelligence Research
Algorithm portfolio selection as a bandit problem with unbounded losses
Annals of Mathematics and Artificial Intelligence
A bayesian approach to tackling hard computational problems
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Evaluating las vegas algorithms: pitfalls and remedies
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Impact of censored sampling on the performance of restart strategies
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Distributed constraint-based local search
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Randomization in constraint programming for airline planning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Expert Systems with Applications: An International Journal
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
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
An Optimal Constraint Programming Approach to the Open-Shop Problem
INFORMS Journal on Computing
On algorithm portfolios and restart strategies
Operations Research Letters
An overview of parallel SAT solving
Constraints
Maximising the net present value for resource-constrained project scheduling
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Partitioning Search Spaces of a Randomized Search
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Choosing probability distributions for stochastic local search and the role of make versus break
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
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
ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
Stratified tree search: a novel suboptimal heuristic search algorithm
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Inductive definitions in constraint programming
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
Factoring out assumptions to speed up MUS extraction
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Search methods for tile sets in patterned DNA self-assembly
Journal of Computer and System Sciences
| Hi-index | 0.89 |