Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Artificial Intelligence
Linear-space best-first search
Artificial Intelligence
Easy problems are sometimes hard
Artificial Intelligence
Experimental results on the application of satisfiability algorithms to scheduling problems
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Nonsystematic backtracking search
Nonsystematic backtracking search
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Sparse constraint graphs and exceptionally hard problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Improved limited discrepancy search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Algorithm performance and problem structure for flow-shop scheduling
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
An efficient approximate algorithm for winner determination in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures
Journal of Heuristics
A Generic Object-Oriented Constraint-Based Model for University Course Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Global Cut Framework for Removing Symmetries
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Amplification of Search Performance through Randomization of Heuristics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
LIME: A System for Learning Relations
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Annals of Mathematics and Artificial Intelligence
Combining local and global search in a constraint programming environment
The Knowledge Engineering Review
A decomposition-based implementation of search strategies
ACM Transactions on Computational Logic (TOCL)
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics
Journal of Heuristics
A unified framework for partial and hybrid search methods in constraint programming
Computers and Operations Research
Non-wrapping order crossover: an order preserving crossover operator that respects absolute position
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Programmed Search in a Timetabling Problem over Finite Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A Flexible Search Framework for CHR
Constraint Handling Rules
Distributed search for supply chain coordination
Computers in Industry
Incomplete tree search using adaptive probing
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Limited discrepancy beam search
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The accuracy of search heuristics: an empirical study on knapsack problems
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Confidence-based work stealing in parallel constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Programming constraint services: high-level programming of standard and new constraint services
Programming constraint services: high-level programming of standard and new constraint services
Discrepancy search for the flexible job shop scheduling problem
Computers and Operations Research
Discrepancy-based sliced neighborhood search
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
Computers and Industrial Engineering
Computers and Operations Research
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Limited discrepancy search revisited
Journal of Experimental Algorithmics (JEA)
Expert Systems with Applications: An International Journal
Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems
Journal of Mathematical Modelling and Algorithms
Extending goal-oriented parallel computer job scheduling policies to heterogeneous systems
The Journal of Supercomputing
Improved bounds for hybrid flow shop scheduling with multiprocessor tasks
Computers and Industrial Engineering
| Hi-index | 0.00 |
Many search trees are impractically large to explore exhaustively. Recently, techniques like limited discrepancy search have been proposed for improving the chance of finding a goal in a limited amount of search. Depth-bounded discrepancy search offers such a hope. The motivation behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top of the tree than at the bottom. We therefore combine one of the best features of limited discrepancy search-the ability to undo early mistakes-with the completeness of iterative deepening search. We show theoretically and experimentally that this novel combination outperforms existing techniques.