Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Tree clustering for constraint networks (research note)
Artificial Intelligence
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Topological parameters for time-space tradeoff
Artificial Intelligence
A general scheme for automatic generation of search heuristics from specification dependencies
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Nonserial Dynamic Programming
Radio Link Frequency Assignment
Constraints
Earth Observation Satellite Management
Constraints
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
An Algorithm for Optimal Winner Determination in Combinatorial Auctions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Dual Graph Translation of a Problem in 'Life'
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
In the quest of the best form of local consistency for weighted CSP
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
A logical approach to efficient Max-SAT solving
Artificial Intelligence
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
Semantic forgetting in answer set programming
Artificial Intelligence
Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Local search for optimal global map generation using mid-decadal landsat images
IAAI'08 Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3
Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
Journal of Artificial Intelligence Research
Using relaxations in maximum density still life
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
The Knowledge Engineering Review
A multi-level memetic/exact hybrid algorithm for the still life problem
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A memetic algorithm with bucket elimination for the still life problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
A complete solution to the Maximum Density Still Life Problem
Artificial Intelligence
Improving combinatorial optimization: extended abstract
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Variable elimination is a general technique for constraint processing. It is often discarded because of its high space complexity. However, it can be extremely useful when combined with other techniques. In this paper we study the applicability of variable elimination to the challenging problem of finding still-lifes. We illustrate several alternatives: variable elimination as a stand-alone algorithm, interleaved with search, and as a source of good quality lower bounds. We show that these techniques are the best known option both theoretically and empirically. In our experiments we have been able to solve the n = 20 instance, which is far beyond reach with alternative approaches.