701 search results - page 133 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
ICCBR
2003
Springer
14 years 17 days ago
2003
Springer
CBR applications running in real domains can easily reach thousands of cases, which are stored in the case library. Retrieval times can increase greatly if the retrieval algorithm ...
SAC
2005
ACM
14 years 27 days ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
IWCLS
2007
Springer
14 years 1 months ago
2007
Springer
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...