1197 search results - page 105 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
EUSFLAT
2007
13 years 9 months ago
2007
The paper is devoted to fault diagnosis problems using fuzzy decision making. We investigate dynamic diagnostic systems which can be represented by symptom-fault rule bases. The m...
AAAI
1997
13 years 9 months ago
1997
Markov Decision Processes (MDPs), currently a popular method for modeling and solving decision theoretic planning problems, are limited by the Markovian assumption: rewards and dy...
ESA
1995
Springer
13 years 12 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
BMCBI
2010
13 years 8 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...