134 search results - page 5 / 27 » An Optimal Rebuilding Strategy for an Incremental Tree Probl... |
152
Voted
STOC
1994
ACM
15 years 5 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
92
Voted
IPCO
2007
15 years 2 months ago
2007
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
106
Voted
ISPD
2003
ACM
15 years 6 months ago
2003
ACM
In 21st-Century VLSI design, clocking plays crucial roles for both performance and timing convergence. Due to their non-convex nature, optimal minimum-delay/area zero-skew wire-si...
118
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
103
Voted
PKDD
2000
Springer
15 years 4 months ago
2000
Springer
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...