Sciweavers

6142 search results - page 26 / 1229
» The Complexity of Partition Functions
Sort
View
JAT
2010
171views more  JAT 2010»
14 years 4 months ago
Chebyshev approximation of the null function by an affine combination of complex exponential functions
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
Paul Armand, Joël Benoist, Elsa Bousquet
TJS
2008
98views more  TJS 2008»
14 years 9 months ago
Mapping functions and data redistribution for parallel files
A parallel file may be physically stored on several independent disks and logically partitioned by several processors. This paper presents general algorithms for mapping between t...
Florin Isaila, Walter F. Tichy
CORR
2006
Springer
73views Education» more  CORR 2006»
14 years 9 months ago
Stable partitions in coalitional games
We propose a notion of a stable partition in a coalitional game that is parametrized by the concept of a defection function. This function assigns to each partition of the grand c...
Krzysztof R. Apt, Tadeusz Radzik
75
Voted
DSD
2008
IEEE
95views Hardware» more  DSD 2008»
15 years 4 months ago
Programmable Numerical Function Generators for Two-Variable Functions
This paper proposes a design method and programmable architectures for numerical function generators (NFGs) of two-variable functions. To realize a two-variable function in hardwa...
Shinobu Nagayama, Jon T. Butler, Tsutomu Sasao
65
Voted
JCT
2002
84views more  JCT 2002»
14 years 9 months ago
Binary Partitions Revisited
The restricted binary partition function bk(n) enumerates the number of ways to represent n as n = 2a0 + 2a1 +
Øystein J. Rødseth, James A. Sellers