Sciweavers

194 search results - page 14 / 39
» Better polynomials for GNFS
Sort
View
DISOPT
2010
132views more  DISOPT 2010»
13 years 9 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
AICOM
2006
124views more  AICOM 2006»
13 years 9 months ago
A Compact Representation for Least Common Subsumers in the description logic ALE
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 9 months ago
Vector Precoding for Wireless MIMO Systems: A Replica Analysis
We apply the replica method to analyze vector precoding, a method to reduce transmit power in antenna array communications. The analysis applies to a very general class of channel...
Ralf R. Müller, Dongning Guo, Aris L. Moustak...
SIMPRA
2008
99views more  SIMPRA 2008»
13 years 9 months ago
Response surface methodology for constrained simulation optimization: An overview
This article summarizes `Generalized Response Surface Methodology'(GRSM), extending Box and Wilson's `Response Surface Methodology'(RSM). GRSM allows multiple rando...
Jack P. C. Kleijnen
DCG
1999
58views more  DCG 1999»
13 years 9 months ago
Nonexistence of Certain Spherical Designs of Odd Strengths and Cardinalities
A spherical -design on Sn-1 is a finite set such that, for all polynomials f of degree at most , the average of f over the set is equal to the average of f over the sphere Sn-1 . ...
Peter Boyvalenkov, Danyo Danev, Svetla Nikova