2157 search results - page 324 / 432 » Binary ant algorithm |
134
Voted
CP
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
161
click to vote
KDD
1999
ACM
15 years 9 months ago
1999
ACM
Satisfying the basic requirements of accuracy and understandability of a classifier, decision tree classifiers have become very popular. Instead of constructing the decision tree ...
161
click to vote
CP
1997
Springer
15 years 9 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
151
Voted
ECP
1997
Springer
15 years 9 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
132
Voted
ASPDAC
1998
ACM
15 years 9 months ago
1998
ACM
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Efficient BDD construction techniques become more important as the complexity of proto...