Results 1  10
of
1,278
Durfee Polynomials
, 1998
"... Let F(n) be a family of partitions of n and let F(n; d) denote the set of partitions in F(n) with Durfee square of size d. We define the Durfee polynomial of F(n) to be the polynomial PF;n = P jF(n; d)jy d , where 0 d b p nc: The work in this paper is motivated by empirical evidence which sugg ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Let F(n) be a family of partitions of n and let F(n; d) denote the set of partitions in F(n) with Durfee square of size d. We define the Durfee polynomial of F(n) to be the polynomial PF;n = P jF(n; d)jy d , where 0 d b p nc: The work in this paper is motivated by empirical evidence which
Durfee Polynomials Extended Abstract
"... Let F(n) be a family of partitions of n and let F(n; d) denote the set of partitions in F(n) with Durfee square of size d. We define the Durfee polynomial of F(n) to be the polynomial PF;n = P jF(n; d)jyd, where 0 ^ d ^ bpnc: This paper describes ongoing efforts to compute statistics associated with ..."
Abstract
 Add to MetaCart
Let F(n) be a family of partitions of n and let F(n; d) denote the set of partitions in F(n) with Durfee square of size d. We define the Durfee polynomial of F(n) to be the polynomial PF;n = P jF(n; d)jyd, where 0 ^ d ^ bpnc: This paper describes ongoing efforts to compute statistics associated
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Methods for Task Allocation Via Agent Coalition Formation
, 1998
"... Task execution in multiagent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where each task should be attached to a group of agents that will perform the task. Task allocation to groups of agents is nece ..."
Abstract

Cited by 360 (21 self)
 Add to MetaCart
Task execution in multiagent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where each task should be attached to a group of agents that will perform the task. Task allocation to groups of agents is necessary when tasks cannot be performed by a single agent. However it may also be beneficial when groups perform more efficiently with respect to the single agents' performance. In this paper we present several solutions to the problem of task allocation among autonomous agents, and suggest that the agents form coalitions in order to perform tasks or improve the efficiency of their performance. We present efficient distributed algorithms with low ratio bounds and with low computational complexities. These properties are proven theoretically and supported by simulations and an implementation in an agent system. Our methods are based on both the algorithmic aspects of combinatorics and approximat...
Partitions, Durfee Symbols, and the AtkinGarvan Moments of Ranks by
, 2006
"... Atkin and Garvan introduced the moments of ranks of partitions in their work connecting ranks and cranks. Here we consider a combinatorial interpretation of these moments. This requires the introduction of a new representation for partitions, the Durfee symbol, and subsequent refinements. This in ..."
Abstract
 Add to MetaCart
Atkin and Garvan introduced the moments of ranks of partitions in their work connecting ranks and cranks. Here we consider a combinatorial interpretation of these moments. This requires the introduction of a new representation for partitions, the Durfee symbol, and subsequent refinements
A. MelleHernández On a Conjecture by A. Durfee
"... “garcia de galdeano” garcía de galdeano seminario matemático n. 02 PREPUBLICACIONES del seminario matematico 2009 ..."
Abstract
 Add to MetaCart
“garcia de galdeano” garcía de galdeano seminario matemático n. 02 PREPUBLICACIONES del seminario matematico 2009
Generalization of Boneh Durfee’s Attack for Arbitrary Public Exponent RSA
"... In 2000, BonehDurfee extended the bound for low private exponent from 0.25 (provided by wiener) to 0.292 with public exponent size is same as modulus size. They have used powerful lattice reduction algorithm (LLL) with coppersmith’s theory of polynomials. In this paper we generalize their attack to ..."
Abstract
 Add to MetaCart
In 2000, BonehDurfee extended the bound for low private exponent from 0.25 (provided by wiener) to 0.292 with public exponent size is same as modulus size. They have used powerful lattice reduction algorithm (LLL) with coppersmith’s theory of polynomials. In this paper we generalize their attack
MULTIPARTITIONS, GENERALIZED DURFEE SQUARES AND AFFINE LIE ALGEBRA CHARACTERS
, 2000
"... Abstract. We give some higher dimensional analogues of the Durfee square formula and point out their relation to dissections of multipartitions. We apply the results to write certain affine Lie algebra characters in terms of Universal Chiral Partition Functions. 1. Introduction and ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We give some higher dimensional analogues of the Durfee square formula and point out their relation to dissections of multipartitions. We apply the results to write certain affine Lie algebra characters in terms of Universal Chiral Partition Functions. 1. Introduction and
Simplification of the lattice based attack of Boneh and Durfee for Rsa Cryptoanalysis
, 2009
"... In this paper we present a new formulation and its simpler analysis of the lattice based attack of Boneh and Durfee for the RSA cryptography [2]. We follow the same approach of Boneh and Durfee, however we propose a new way of defining a lattice with which we can achieve the same solvable key bound ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we present a new formulation and its simpler analysis of the lattice based attack of Boneh and Durfee for the RSA cryptography [2]. We follow the same approach of Boneh and Durfee, however we propose a new way of defining a lattice with which we can achieve the same solvable key bound
Results 1  10
of
1,278