The combinatorics of local constraints in model-based recognition and localization from sparse data
Journal of the ACM (JACM)
A polynomial time algorithm for the N-Queens problem
ACM SIGART Bulletin
The Combinatorics of Heuristic Search Termination for Object Recognition in Cluttered Environments
IEEE Transactions on Pattern Analysis and Machine Intelligence
3,000,000 Queens in less than one minute
ACM SIGART Bulletin
Hypertext and structured object representation: an unifying view
HYPERTEXT '91 Proceedings of the third annual ACM conference on Hypertext
Minimax Search Algorithms With and Without Aspiration Windows
IEEE Transactions on Pattern Analysis and Machine Intelligence
HIS: an information system about hypertext on hypertext
ACM SIGWEB Newsletter
Complexity analysis admissible heuristic search
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Encodings of non-binary constraint satisfaction problems
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
Analysis of heurisitc search models
CSC '87 Proceedings of the 15th annual conference on Computer Science
Construction through decomposition: a divide-and-conquer algorithm for the N-queens problem
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Multi-agent oriented constraint satisfaction
Artificial Intelligence
An Overview of Backtrack Search Satisfiability Algorithms
Annals of Mathematics and Artificial Intelligence
Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem
IEEE Transactions on Knowledge and Data Engineering
Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens
IEEE Expert: Intelligent Systems and Their Applications
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Annals of Mathematics and Artificial Intelligence
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
Journal of Automated Reasoning
Modified branch and bound algorithm
EC'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8
Anytime search in dynamic graphs
Artificial Intelligence
Constraint satisfaction problem using modified branch and bound algorithm
WSEAS Transactions on Computers
Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles
International Journal of Robotics Research
Journal of Artificial Intelligence Research
Heuristic search theory: survey of recent results
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
A learning system which accommodates feature interactions
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Towards finding optimal solutions with non-admissible heuristics: a new technique
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Complete solution of the eight-puzzle and the benefit of node ordering in IDA
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
The difference all-difference makes
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A problem similarity approach to devising heuristics: first results
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
High-performance A* search using rapidly growing heuristics
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
AI Communications - Practical Aspects of Automated Reasoning
The effect of Nogood recording in DPLL-CBJ SAT algorithms
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Predicting the performance of IDA* using conditional distributions
Journal of Artificial Intelligence Research
Linear-space best-first search: summary of results
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Artificial intelligence search algorithms
Algorithms and theory of computation handbook
Efficient Generation of Stimuli for Functional Verification by Backjumping Across Extended FSMs
Journal of Electronic Testing: Theory and Applications
Possibilistic constraint satisfaction problems or "How to handle soft constraints ?"
UAI'92 Proceedings of the Eighth international conference on Uncertainty in artificial intelligence
Self-control of the time complexity of a constraint satisfaction problem solver program
Journal of Systems and Software
The time complexity of A* with approximate heuristics on multiple-solution search spaces
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |