AAAI
2000
13 years 11 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
AAAI
1998
13 years 11 months ago
1998
AAAI
2000
13 years 11 months ago
2000
There are a number of frameworks for modelling argumentation in logic. They incorporate formal representation of individual arguments and techniques for comparing conflicting argu...
AAAI
1998
13 years 11 months ago
1998
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...
AAAI
2000
13 years 11 months ago
2000
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
AAAI
1998
13 years 11 months ago
1998
AAAI
1998
13 years 11 months ago
1998
AAAI
2000
13 years 11 months ago
2000
Although much has been written about various information integration technologies, little has been said regarding how to combine these technologies together to build an entire &qu...
AAAI
1998
13 years 11 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
AAAI
2000
13 years 11 months ago
2000
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...