49 search results - page 6 / 10 » Exact algorithms and applications for Tree-like Weighted Set... |
RC
2007
13 years 6 months ago
2007
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
4OR
2008
13 years 6 months ago
2008
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
DISOPT
2008
13 years 7 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
MICS
2010
13 years 2 months ago
2010
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...