Local search characteristics of incomplete SAT procedures
Artificial Intelligence
Local search for distributed SAT with complex local problems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Problem difficulty for tabu search in job-shop scheduling
Artificial Intelligence
Permutation Problems and Channelling Constraints
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Modelling More Realistic SAT Problems
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Random Instance Generation for MAX 3SAT
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Capturing Structure with Satisfiability
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
CP '02 Proceedings of the 8th 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
On market-inspired approaches to propositional satisfiability
Artificial Intelligence
Eighteenth national conference on Artificial intelligence
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
The Knowledge Engineering Review
Limited assignments: a new cutoff strategy for incomplete depth-first search
Proceedings of the 2005 ACM symposium on Applied computing
When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems
Artificial Intelligence Review
On the complexity of unfrozen problems
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Regular Random k-SAT: Properties of Balanced Formulas
Journal of Automated Reasoning
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
Journal of Automated Reasoning
Evolving combinatorial problem instances that are difficult to solve
Evolutionary Computation
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
Discrete Applied Mathematics
Regular-SAT: A many-valued approach to solving combinatorial problems
Discrete Applied Mathematics
Edge Matching Puzzles as Hard SAT/CSP Benchmarks
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Exploiting weak dependencies in tree-based search
Proceedings of the 2009 ACM symposium on Applied Computing
Empirical hardness models: Methodology and a case study on combinatorial auctions
Journal of the ACM (JACM)
Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
How Hard is a Commercial Puzzle: the Eternity II Challenge
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
The backdoor key: a path to understanding problem hardness
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Hiding satisfying assignments: two are better than one
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Generating "random" 3-SAT instances with specific solution space structure
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Further investigations into regular XORSAT
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
The impact of balancing on problem hardness in a highly structured domain
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Generating hard satisfiable formulas by hiding solutions deceptiveily
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Backbones and backdoors in satisfiability
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Phase transitions and backbones of the asymmetric traveling salesman problem
Journal of Artificial Intelligence Research
Hiding satisfying assignments: two are better than one
Journal of Artificial Intelligence Research
Generating hard satisfiable formulas by hiding solutions deceptively
Journal of Artificial Intelligence Research
Backbones in optimization and approximation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Balance and filtering in structured satisfiable problems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
On market-inspired approaches to propositional satisfiability
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Reducing checks and revisions in coarse-grained MAC algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A simple model to generate hard satisfiable instances
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On the complexity of unfrozen problems
Discrete Applied Mathematics
Discrete Applied Mathematics
An information hiding method based on computational intractable problems
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Time-reversal in conway's life as SAT
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Understanding the behavior of Solution-Guided Search for job-shop scheduling
Journal of Scheduling
An improved satisfiable SAT generator based on random subgraph isomorphism
Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
Generating highly balanced sudoku problems as hard problems
Journal of Heuristics
A bayesian approach to tackling hard computational problems
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Protecting data privacy through hard-to-reverse negative databases
ISC'06 Proceedings of the 9th international conference on Information Security
A backbone-based co-evolutionary heuristic for partial MAX-SAT
EA'05 Proceedings of the 7th international conference on Artificial Evolution
Phase transition of tractability in constraint satisfaction and bayesian network inference
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Tie breaking in clause weighting local search for SAT
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
From spin glasses to hard satisfiable formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Searching for high-value rare events with uncheatable grid computing
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Logical analysis of hash functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
On generators of random quasigroup problems
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Challenging heuristics: evolving binary constraint satisfaction problems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Learning vector quantization for variable ordering in constraint satisfaction problems
Pattern Recognition Letters
From sequential to parallel local search for SAT
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Hi-index | 0.00 |