494 search results - page 95 / 99 » Optimal Carpet Cutting |
GECCO
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
STOC
2010
ACM
14 years 6 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
INFOCOM
1998
IEEE
13 years 11 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper, we propose a novel predictive model for
object boundary, which can integrate information from any
sources. The model is a dynamic “object” model whose
manifes...