2492 search results - page 295 / 499 » On the General Signature Trees |
180
click to vote
FSTTCS
1995
Springer
15 years 10 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
199
click to vote
WG
1995
Springer
15 years 10 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
162
click to vote
AIIDE
2008
15 years 9 months ago
2008
Dialogue in commercial games is largely created by teams of writers and designers who hand-author every line of dialogue and hand-specify the dialogue structure using finite state...
176
click to vote
WSC
2008
15 years 9 months ago
2008
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
151
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Representing agent policies compactly is essential for improving the scalability of multi-agent planning algorithms. In this paper, we focus on developing a pruning technique that...