Results 1  10
of
2,153
On Two ClassConstrained Versions of the Multiple Knapsack Problem
, 2001
"... We study two variants of the classic knapsack problem, in which we need to place items of different types in multiple knapsacks; each knapsack has a limited capacity, and a bound on the number of different types of items it can hold: in the classconstrained multiple knapsack problem (CMKP) we wis ..."
Abstract

Cited by 32 (7 self)
 Add to MetaCart
We study two variants of the classic knapsack problem, in which we need to place items of different types in multiple knapsacks; each knapsack has a limited capacity, and a bound on the number of different types of items it can hold: in the classconstrained multiple knapsack problem (CMKP) we
Least angle regression
, 2004
"... The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope to s ..."
Abstract

Cited by 1326 (37 self)
 Add to MetaCart
implements the Lasso, an attractive version of ordinary least squares that constrains the sum of the absolute regression coefficients; the LARS modification calculates all possible Lasso estimates for a given problem, using an order of magnitude less computer time than previous methods. (2) A different LARS
A constrained version of Sauer's Lemma
, 2004
"... We generalize Sauer's Lemma to finite V Cdimension classes functions on [n] = . . . , n} which have a margin of at least N on every element in a sample S [n] of cardinality l, where the margin h (x) of h on a point [n] is defined as the largest nonnegative integer a such that h ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We generalize Sauer's Lemma to finite V Cdimension classes functions on [n] = . . . , n} which have a margin of at least N on every element in a sample S [n] of cardinality l, where the margin h (x) of h on a point [n] is defined as the largest nonnegative integer a such that h is constant on the interval I a (x) = [x a, x + a].
Fixedlag smoothing as a constrained version of the fixedinterval case
 In Proceedings of the 2004 American control conference
, 2004
"... AbstractThis paper studies the H ∞ fixedlag smoothing problem in both continuous and discrete time. The central idea is to address it as a constrained version of the fixedinterval smoothing (L ∞ estimation) problem. This enables us to separate geometric (which are independent of the smoothing lag ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
AbstractThis paper studies the H ∞ fixedlag smoothing problem in both continuous and discrete time. The central idea is to address it as a constrained version of the fixedinterval smoothing (L ∞ estimation) problem. This enables us to separate geometric (which are independent of the smoothing
Constructing ConstrainedVersion of Magic Squares Using Selection Hyperheuristics
"... A square matrix of distinct numbers in which every row, column and both diagonals has the same total is referred to as a magic square. Constructing a magic square of a given order is considered as a difficult computational problem, particularly when additional constraints are imposed. Hyperheuristi ..."
Abstract
 Add to MetaCart
heuristics are emerging high level search methodologies that explore the space of heuristics for solving a given problem. In this study, we present a range of effective selection hyperheuristics mixing perturbative low level heuristics for constructing the constrained version of magic squares. The results show
Marchini J: A flexible and accurate genotype imputation method for the next generation of genomewide association studies. PLoS Genet 2009
"... Genotype imputation methods are now being widely used in the analysis of genomewide association studies. Most imputation analyses to date have used the HapMap as a reference dataset, but new reference panels (such as controls genotyped on multiple SNP chips and densely typed samples from the 1,000 ..."
Abstract

Cited by 449 (5 self)
 Add to MetaCart
,000 Genomes Project) will soon allow a broader range of SNPs to be imputed with higher accuracy, thereby increasing power. We describe a genotype imputation method (IMPUTE version 2) that is designed to address the challenges presented by these new datasets. The main innovation of our approach is a flexible
L.: On three constrained versions of the digital circular arc recognition problem
 In: 15th International Conference on Discrete Geometry for Computer Imagery (DGCI09
, 2009
"... Abstract. In this paper, the problem of digital circular arcs recognition is investigated in a new way. The main contribution is a simple and lineartime algorithm for solving three subproblems: online recognition of digital circular arcs coming from the digitization of a disk having either a given ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. In this paper, the problem of digital circular arcs recognition is investigated in a new way. The main contribution is a simple and lineartime algorithm for solving three subproblems: online recognition of digital circular arcs coming from the digitization of a disk having either a given radius, a boundary that is incident with a given point, or a center that is on a given straight line. Solving these subproblems is interesting in itself, but also for the recognition of digital circular arcs. Indeed the proposed algorithm can be iteratively used for the recognition of circular arcs. Moreover, since the algorithm is online, it provides a way for segmenting digital curves. 1
EXE: Automatically generating inputs of death
 In Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS
, 2006
"... This article presents EXE, an effective bugfinding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input, EXE runs it on symbolic input initially allowed to be anything. As checked code runs, EXE tracks the constraints on ea ..."
Abstract

Cited by 349 (21 self)
 Add to MetaCart
on each symbolic (i.e., inputderived) memory location. If a statement uses a symbolic value, EXE does not run it, but instead adds it as an inputconstraint; all other statements run as usual. If code conditionally checks a symbolic expression, EXE forks execution, constraining the expression to be true
MAFFT Multiple Sequence Alignment Software Version 7: Improvements in Performance and Usability
, 2013
"... We report a major update of the MAFFT multiple sequence alignment program. This version has several new features, including options for adding unaligned sequences into an existing alignment, adjustment of direction in nucleotide alignment, constrained alignment and parallel processing, which were im ..."
Abstract

Cited by 280 (4 self)
 Add to MetaCart
We report a major update of the MAFFT multiple sequence alignment program. This version has several new features, including options for adding unaligned sequences into an existing alignment, adjustment of direction in nucleotide alignment, constrained alignment and parallel processing, which were
A CONSTRAINED VERSION of a CLUSTERING ALGORITHM for SWITCH PLACEMENT and INTERCONNECTION in LARGE NETWORKS
"... This paper presents an extension to a clustering algorithm used for the heuristic calculation of switch location and interconnection in large networks. The original algorithm, a geometric form of weighted, representative reduction is constrained by a maximum load limit for replacement nodes. This ha ..."
Abstract
 Add to MetaCart
This paper presents an extension to a clustering algorithm used for the heuristic calculation of switch location and interconnection in large networks. The original algorithm, a geometric form of weighted, representative reduction is constrained by a maximum load limit for replacement nodes
Results 1  10
of
2,153