Results 11  20
of
2,590,306
A Scatter Search Method for the Multidimensional Knapsack Problem with Generalized Upper Bound Constraints
"... In this paper, a scatter search (SS) heuristic is proposed to solve the multidimensional knapsack problem with generalized upper bound constraints (GUBMKP). The method is organized according to the general structure of SS. We discuss the design and implementation for each of the components of SS. A ..."
Abstract
 Add to MetaCart
In this paper, a scatter search (SS) heuristic is proposed to solve the multidimensional knapsack problem with generalized upper bound constraints (GUBMKP). The method is organized according to the general structure of SS. We discuss the design and implementation for each of the components of SS
Generalized Upper Bound of Agreement Probability for Extracting Common Random Bits From Correlated Sources
"... Abstract: Suppose that both Alice and Bob receive independent random bits without any bias, which are influenced by an independent noise. From the received random bits, Alice and Bob are willing to extract common randomness, without any communication. The extracted common randomness can be used for ..."
Abstract
 Add to MetaCart
for authentication or secrets. Recently, Bogdanov and Mossel derived an upper bound of the agreement probability, based on the minentropy of outputs. In this paper, we derive a generalized upper bound of the probability of extracting common random bits from correlated sources, using the Rènyi entropy of order 1
On bounds available from branchandprice decomposition of the multidimensional knapsack problem with generalized upper bound constraints
, 2007
"... This paper describes and evaluates alternative branchandprice decompositions (B&PDs) of the multidimensional knapsack problem with generalized upper bound constraints both analytically and computationally. As part of our theoretical analysis we compare the bounds available from B&PDs wi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper describes and evaluates alternative branchandprice decompositions (B&PDs) of the multidimensional knapsack problem with generalized upper bound constraints both analytically and computationally. As part of our theoretical analysis we compare the bounds available from B
A GENERALIZED UPPER BOUND SOLUTION FOR EXTRUSION OF BIMETALLIC RECTANGULAR CROSSSECTION BARS THROUGH DIES OF ANY SHAPE
"... In this paper, a generalized upper bound solution is developed for extrusion of bimetallic rectangular crosssection bars through dies of any shape. The internal, shearing and frictional power terms are derived and they are used in the upper bound model. By using the developed upper bound model, t ..."
Abstract
 Add to MetaCart
In this paper, a generalized upper bound solution is developed for extrusion of bimetallic rectangular crosssection bars through dies of any shape. The internal, shearing and frictional power terms are derived and they are used in the upper bound model. By using the developed upper bound model
A PerturbationGuided Oscillation Strategy for the Multidimensional Knapsack Problem with Generalized Upper Bound Constraints
"... Abstract The multidimensional knapsack problem with generalized upper bound constraints (referred as GUBMKP) can be seen as a special case of the multidimensional knapsack problem where variables are partitioned into several multiplechoice sets and at most one variable can be chosen from each set. ..."
Abstract
 Add to MetaCart
Abstract The multidimensional knapsack problem with generalized upper bound constraints (referred as GUBMKP) can be seen as a special case of the multidimensional knapsack problem where variables are partitioned into several multiplechoice sets and at most one variable can be chosen from each set
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds
"... Motivated by addressing probabilistic 0–1 programs we study the conic quadratic knapsack polytope with generalized upper bound (GUB) constraints. In particular, we investigate separating and extending GUB cover inequalities. We show that, unlike in the linear case, determining whether a cover can be ..."
Abstract
 Add to MetaCart
Motivated by addressing probabilistic 0–1 programs we study the conic quadratic knapsack polytope with generalized upper bound (GUB) constraints. In particular, we investigate separating and extending GUB cover inequalities. We show that, unlike in the linear case, determining whether a cover can
Boosting a Weak Learning Algorithm By Majority
, 1995
"... We present an algorithm for improving the accuracy of algorithms for learning binary concepts. The improvement is achieved by combining a large number of hypotheses, each of which is generated by training the given learning algorithm on a different set of examples. Our algorithm is based on ideas pr ..."
Abstract

Cited by 517 (16 self)
 Add to MetaCart
presented by Schapire in his paper "The strength of weak learnability", and represents an improvement over his results. The analysis of our algorithm provides general upper bounds on the resources required for learning in Valiant's polynomial PAC learning framework, which are the best general
The strength of weak learnability
 MACHINE LEARNING
, 1990
"... This paper addresses the problem of improving the accuracy of an hypothesis output by a learning algorithm in the distributionfree (PAC) learning model. A concept class is learnable (or strongly learnable) if, given access to a Source of examples of the unknown concept, the learner with high prob ..."
Abstract

Cited by 870 (26 self)
 Add to MetaCart
, the construction has some interesting theoretical consequences, including a set of general upper bounds on the complexity of any strong learning algorithm as a function of the allowed error e.
An Extension of Generalized Upper Bounding Techniques for Structured Linear Programs", SIAM1
 Journal of Applied Mathematics
, 1967
"... " IfT An algorithm is developed for solving a special structured linear program. The particular structure studied has a large number of blocks coupled together by a relatively few connecting equations. The method proposed is an extension of [2] and, from the basis, defines a working basis whic ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
" IfT An algorithm is developed for solving a special structured linear program. The particular structure studied has a large number of blocks coupled together by a relatively few connecting equations. The method proposed is an extension of [2] and, from the basis, defines a working basis which is much smaller in size than the original. Two methods of updating the working basis are proposed. a
Towards a Standard Upper Ontology
, 2001
"... The Suggested Upper Merged Ontology (SUMO) is an upper level ontology that has been proposed as a starter document for The Standard Upper Ontology Working Group, an IEEEsanctioned working group of collaborators from the fields of engineering, philosophy, and information science. The SUMO provides d ..."
Abstract

Cited by 587 (22 self)
 Add to MetaCart
The Suggested Upper Merged Ontology (SUMO) is an upper level ontology that has been proposed as a starter document for The Standard Upper Ontology Working Group, an IEEEsanctioned working group of collaborators from the fields of engineering, philosophy, and information science. The SUMO provides
Results 11  20
of
2,590,306