Results 1  10
of
314,860
Stacked generalization
 NEURAL NETWORKS
, 1992
"... This paper introduces stacked generalization, a scheme for minimizing the generalization error rate of one or more generalizers. Stacked generalization works by deducing the biases of the generalizer(s) with respect to a provided learning set. This deduction proceeds by generalizing in a second sp ..."
Abstract

Cited by 713 (8 self)
 Add to MetaCart
in this paper, the conclusion is that for almost any realworld generalization problem one should use some version of stacked generalization to minimize the generalization error rate. This paper ends by discussing some of the variations of stacked generalization, and how it touches on other fields like chaos
Stack Problems and Care
"... BEFOREDEALING with specific problems encountered in the administration of book stacks, it might be well to remind the reader that this subject has a close resemblance to the weather as a topic for discussion. Authorities concede that the first American bookstack came into being in 1877 when Gore Hal ..."
Abstract
 Add to MetaCart
BEFOREDEALING with specific problems encountered in the administration of book stacks, it might be well to remind the reader that this subject has a close resemblance to the weather as a topic for discussion. Authorities concede that the first American bookstack came into being in 1877 when Gore
An Evolutionary Algorithm for the Block Stacking Problem
"... Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for applied statics and at the same time leads to a challenging optimization problem that was discussed recently in two t ..."
Abstract
 Add to MetaCart
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for applied statics and at the same time leads to a challenging optimization problem that was discussed recently in two
UCPOP: A Sound, Complete, Partial Order Planner for ADL
, 1992
"... We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove ucpo ..."
Abstract

Cited by 490 (24 self)
 Add to MetaCart
ucpop is both sound and complete for this representation and describe a practical implementation that succeeds on all of Pednault's and McDermott's examples, including the infamous "Yale Stacking Problem" [McDermott 1991].
Abstract Sloane’s Box Stacking Problem
"... 1, 2,..., n. For i = 1,..., n, box i weighs (m − 1)i grams (where m ≥ 2 is a fixed integer) and box i can support a total weight of i grams. What is the number of different ways to build a single stack of boxes in which no box will be squashed by the weight of the boxes above it? Prior to this gener ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
1, 2,..., n. For i = 1,..., n, box i weighs (m − 1)i grams (where m ≥ 2 is a fixed integer) and box i can support a total weight of i grams. What is the number of different ways to build a single stack of boxes in which no box will be squashed by the weight of the boxes above it? Prior
Ant Colony Optimization for Solving Container Stacking Problems
"... Abstract. This paper reports the results of a study to use the ant colony optimization (ACO) in solving an export container stacking and storage problem of a container terminal port. Three different methods of solutions based on different initial solution techniques and the current method used by th ..."
Abstract
 Add to MetaCart
Abstract. This paper reports the results of a study to use the ant colony optimization (ACO) in solving an export container stacking and storage problem of a container terminal port. Three different methods of solutions based on different initial solution techniques and the current method used
Hybrid Algorithms to Solve the Container Stacking Problem at Seaport
"... Abstract—A storage yard is a key resource in a container terminal. The effectiveness of its exploitation is an important factor to a port's productivity. Therefore, it is very important to adapt a good storage policy. In this paper, we propose a shared storage strategy, which is modeled mathema ..."
Abstract
 Add to MetaCart
mathematically with a mixed integer linear program. We consider a multimodal container terminal, and take into account physical and operational constraints. This problem is Nphard, and cannot be solved by optimization solvers when there are too many containers. So, we propose four algorithms to solve it
A biased randomkey genetic algorithm for the Minimization of Open Stacks Problem ∗
"... This paper describes a biased randomkey genetic algorithm (BRKGA) for the Minimization of Open Stacks Problem (MOSP). The MOSP arises in a production system scenario, and consists of determining a sequence of cutting patterns that minimizes the maximum number of opened stacks during the cutting pro ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper describes a biased randomkey genetic algorithm (BRKGA) for the Minimization of Open Stacks Problem (MOSP). The MOSP arises in a production system scenario, and consists of determining a sequence of cutting patterns that minimizes the maximum number of opened stacks during the cutting
2Opt Population Training for Minimization of Open Stack Problem
"... This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Minimization Open Stack Problem (MOSP). The MOSP happens in a production system scenario, and consists of determining a sequence of cut patterns that minimizes the maximum number of opened stacks during the cutt ..."
Abstract
 Add to MetaCart
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Minimization Open Stack Problem (MOSP). The MOSP happens in a production system scenario, and consists of determining a sequence of cut patterns that minimizes the maximum number of opened stacks during
Solving the Minimum Number of Open Stacks Problem with ExplanationBased Techniques
"... This paper presents a study conducted on the minimum number of open stacks problem (MOSP) which occurs in various production environments where an efficient simultaneous utilization of resources (stacks) is needed to achieve a set of tasks. We investigate through this problem how classical lookback ..."
Abstract
 Add to MetaCart
This paper presents a study conducted on the minimum number of open stacks problem (MOSP) which occurs in various production environments where an efficient simultaneous utilization of resources (stacks) is needed to achieve a set of tasks. We investigate through this problem how classical look
Results 1  10
of
314,860