Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
240
Permutation Problems and Channelling Constraints
- TR 26, APES Group
, 2001
"... When writing a constraint program, we have to decide what to make the decision variable, and how to represent the constraints on these variables. In many cases, there is considerable choice for the decision variables. For example, with permutation problems, we can choose between a primal and a dual ..."
Abstract
-
Cited by 39 (2 self)
- Add to MetaCart
of these different models. Our results will aid constraint programmers to choose a model for a permutation problem. They also illustrate a general methodology for comparing different constraint models.
Combinatorial specification of permutation classes †
"... Abstract. This article presents a methodology that automatically derives a combinatorial specification for the permutation class C = Av(B), given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is achieved considering both pattern avoid ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Abstract. This article presents a methodology that automatically derives a combinatorial specification for the permutation class C = Av(B), given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is achieved considering both pattern
Permutation Problems and Channelling Constraints
"... We perform an extensive study of several different models of permutation problems proposed by Smith in [Smith, 2000]. We first define a measure of constraint tightness parameterized by the level of local consistency being enforced. We then compare the constraint tightness in these different models w ..."
Abstract
- Add to MetaCart
users of constraints to choose a model for a permutation problem, and a local consistency property to enforce upon it. They also illustrate a methodology, as well as a measure of constraint tightness, that can be used to compare different constraint models. 1
Radical Interpretation and the Permutation Principle *
"... Davidson has argued 1 that there is no fact of the matter as to what any speaker's words refer to because, even holding truth conditions fixed, a radical interpreter will always be able to come up with many equally good interpretations of the interpretee’s language. This conclusion, which David ..."
Abstract
- Add to MetaCart
methodology. In particular, Davidson claims that the following assumption (which will hereafter be referred to as the "Permutation Principle") is "clearly needed if we are to conclude to the inscrutability of reference": If some theory of truth (or translation or interpretation
Reversible logic synthesis with output permutation
- in VLSI Design
, 2009
"... Synthesis of reversible logic has become a very impor-tant research area. In recent years several algorithms – heuristic as well as exact ones – have been introduced in this area. Typically, they use the specification of a reversible function in terms of a truth table as input. Here, the posi-tion o ..."
Abstract
-
Cited by 16 (10 self)
- Add to MetaCart
-tion of the outputs are fixed. However, in general it is irrel-evant, how the respective outputs are ordered. Thus, a syn-thesis methodology is proposed that determines for a given reversible function an equivalent circuit realization modulo output permutation. More precisely, the result of the syn-thesis process
Efficient permutation instructions for fast software cryptography
- IEEE Micro
, 2001
"... To achieve pervasive secure information processing over the public wired and wireless Internet, it is desirable to be able to perform cryptographic transformations rapidly and conveniently. The performance of software-implemented cryptographic functions is hampered by certain operations which have n ..."
Abstract
-
Cited by 32 (9 self)
- Add to MetaCart
permutation instructions and the underlying methodology for performing arbitrary n-bit permutations efficiently in programmable processors. While targeted at solving the more difficult problem of permuting n 1-bit elements, we also address the issue of permuting a smaller number of multi-bit subwords packed
Speeding up Permutation Testing in Neuroimaging
"... Abstract Multiple hypothesis testing is a significant problem in nearly all neuroimaging studies. In order to correct for this phenomena, we require a reliable estimate of the Family-Wise Error Rate (FWER). The well known Bonferroni correction method, while being simple to implement, is quite conse ..."
Abstract
- Add to MetaCart
-sampled -on the order of 0.5% -matrix completion methods. Thus, we propose a novel permutation testing methodology which offers a large speedup, without sacrificing the fidelity of the estimated FWER. Our evaluations on four different neuroimaging datasets show that a computational speedup factor of roughly
Speeding up Permutation Testing in Neuroimaging ∗
"... Multiple hypothesis testing is a significant problem in nearly all neuroimaging studies. In order to correct for this phenomena, we require a reliable estimate of the Family-Wise Error Rate (FWER). The well known Bonferroni correction method, while simple to implement, is quite conservative, and can ..."
Abstract
- Add to MetaCart
–sampled — on the order of 0.5 % — matrix comple-tion methods. Based on this observation, we propose a novel permutation testing methodology which offers a large speedup, without sacrificing the fidelity of the estimated FWER. Our evaluations on four different neuroimaging datasets show that a computational speedup
Context-Independent Scatter and Tabu Search for Permutation Problems
, 2001
"... In this paper, we develop a general purpose heuristic for permutations problems. The procedure is based on the scatter search and tabu search methodologies and treats the objective function evaluation as a black box, making the search algorithm context-independent. We perform computational experimen ..."
Abstract
-
Cited by 7 (4 self)
- Add to MetaCart
In this paper, we develop a general purpose heuristic for permutations problems. The procedure is based on the scatter search and tabu search methodologies and treats the objective function evaluation as a black box, making the search algorithm context-independent. We perform computational
LONGEST ALTERNATING SUBSEQUENCES IN PATTERN-RESTRICTED PERMUTATIONS
"... Abstract. Inspired by the results of Stanley and Widom concerning the limiting distribution of the lengths of longest alternating subsequences in random permutations, and results of Deutsch, Hildebrand and Wilf on the limiting distribution of the longest increasing subsequence for pattern-restricted ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
-restricted permutations, we find the limiting distribution of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length three. Our methodology uses recurrences, generating functions, and complex analysis, and also yields more detailed information
Results 1 - 10
of
240
