Mitwirkungsrechte der Aktionäre beim Kauf von Unternehmen?

Decher, Christian E.

doi:10.9785/ovs.9783504380717.261

Cited by 1 publication

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…DTS is committed to solving the meta-tree CSP structure in a Depth-First Search Tree (DFS Tree) where the root metanode is composed of the most constrained single-tree (in the sense that this single-tree maintains a higher number of single-nodes). DFS trees have already been investigated as a means to boost search (Decher 2003). Due to the relative independence of nodes lying in different branches of the DFS tree, it is possible to perform search in parallel on these independent branches.…”

Section: Dfstreesearch Algorithm (Dts)mentioning

confidence: 99%

See 1 more Smart Citation

Distributed search in railway scheduling problems

Abril

Salido

Barber

2008

Engineering Applications of Artificial Intelligence

View full text Add to dashboard Cite

Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete; however, distributed models may take advantage of dividing the problem into a set of simpler interconnected sub-problems which can be more easily solved. The purpose of this paper is threefold: first, we present a technique to distribute the constraint network by means of selection of tree structures. Thus, the CSP is represented as a meta-tree CSP structure that is used as a hierarchy of communication by our distributed algorithm. Then, a distributed and asynchronous search algorithm (DTS) is presented. DTS is committed to solving the meta-tree CSP structure in a Depth-First Search Tree. Finally, an intra-agent search algorithm is presented. This algorithm takes into account the Nogood message to prune the search space. We have focused our research on the railway scheduling problem which can be distributed by tree structures. We show that our distributed algorithm outperforms well-known centralized algorithms.

show abstract

Section: Dfstreesearch Algorithm (Dts)mentioning

confidence: 99%

“…This algorithm is based on the theorem presented in (Decher 2003): "Let d be a width-1 ordering of a constraint tree T. If T is arc-consistent relative to d, then the network is backtracking-free along d". Therefore, TSA finds a partial solution in polynomial time.…”

Section: Intra-agent Searchmentioning

confidence: 99%