The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Journal of the ACM (JACM)
A program to solve the Pentomino problem by the recursive use of macros
Communications of the ACM
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Selected combinatorial research problems.
Selected combinatorial research problems.
A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
The complexity of backtrack searches
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Efficient search techniques—an empirical study of the N-Queens problem
IBM Journal of Research and Development
A dynamic constraint-directed ordered search algorithm for solving constraint satisfaction problems
IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
Isomorphism and the N-Queens problem
ACM SIGCSE Bulletin
History cache: hardware support for reverse execution
ACM SIGARCH Computer Architecture News
Analyzing external conditions to improve the efficiency of HTN planning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Intelligent backtracking using symmetry
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Iambic IBM AI: the palindrome discovery AI project
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
ACM Computing Surveys (CSUR)
Backtracking in a Generalized Control Setting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Application of constraint-based heuristics in collaborative design
Proceedings of the 38th annual Design Automation Conference
Solution Techniques for Constraint Satisfaction Problems: Foundations
Artificial Intelligence Review
Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches
Artificial Intelligence Review
Multi-agent oriented constraint satisfaction
Artificial Intelligence
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Backtracking and random constraint satisfaction
Annals of Mathematics and Artificial Intelligence
Maintenance scheduling problems as benchmarks for constraint algorithms
Annals of Mathematics and Artificial Intelligence
A Connectionist Approach for Solving Large ConstraintSatisfaction Problems
Applied Intelligence
Convergence Properties of Optimization Algorithms for the SAT Problem
IEEE Transactions on Computers
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem
IEEE Transactions on Knowledge and Data Engineering
Backtrack searching in the presence of symmetry
Nordic Journal of Computing
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Viewing construction scheduling as a constraint satisfaction problem
ICAAICSE '01 Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Hard, flexible and dynamic constraint satisfaction
The Knowledge Engineering Review
Exhaustive approaches to 2D rectangular perfect packings
Information Processing Letters
Gradual Relaxation Techniques with Applications to Behavioral Synthesis
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
N-queens pattern generation: an insight into space complexity of a backtracking algorithm
ISICT '04 Proceedings of the 2004 international symposium on Information and communication technologies
Staffing a software project: A constraint satisfaction and optimization-based approach
Computers and Operations Research
Analogical recognition of shape and structure in design drawings
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Engineering Applications of Artificial Intelligence
Algorithms and Architectures of Artificial Intelligence
Proceedings of the 2007 conference on Algorithms and Architectures of Artificial Intelligence
Web History Tools and Revisitation Support: A Survey of Existing Approaches and Directions
Foundations and Trends in Human-Computer Interaction
VHPOP: versatile heuristic partial order planner
Journal of Artificial Intelligence Research
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
The design and experimental analysis of algorithms for temporal reasoning
Journal of Artificial Intelligence Research
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
A planning/scheduling methodology for the constrained resource problem
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Constraint satisfiability algorithms for interactive student scheduling
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Domain filtering can degrade intelligent backtracking search
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Information-theoretic approaches to branching in search
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A theoretical evaluation of selected backtracking algorithms
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Optimizing backtrack search for all solutions to conjunctive problems
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
An expected-cost analysis of backtracking and non-backtracking algorithms
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Efficient graph automorphism by vertex partitioning
Artificial Intelligence
Search rearrangement backtracking and polynomial average time
Artificial Intelligence
Solution strategies for multi-domain constraint logic programs
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Continuous constraint query evaluation for spatiotemporal streams
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
The Knowledge Engineering Review
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Summarizing CSP hardness with continuous probability distributions
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Neural networks to guide the selection of heuristics within constraint satisfaction problems
MCPR'11 Proceedings of the Third Mexican conference on Pattern recognition
New decision rules for exact search in N-Queens
Journal of Global Optimization
Efficient solutions for a problem in currency systems
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part I
Concurrent applicative implementations of nondeterministic algorithms
Computer Languages
Backtracking tactics in the backtrack method for SAT
Mathematical and Computer Modelling: An International Journal
Information-theoretic approaches to branching in search
Discrete Optimization
Improving the performance of vector hyper-heuristics through local search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Using XQuery for problem solving
Software—Practice & Experience
Learning vector quantization for variable ordering in constraint satisfaction problems
Pattern Recognition Letters
Expert Systems with Applications: An International Journal
| Hi-index | 48.25 |
The purpose of this paper is twofold. First, a brief exposition of the general backtrack technique and its history is given. Second, it is shown how the use of macros can considerably shorten the computation time in many cases. In particular, this technique has allowed the solution of two previously open combinatorial problems, the computation of new terms in a well-known series, and the substantial reduction in computation time for the solution to another combinatorial problem.