Sciweavers

7840 search results - page 31 / 1568
» On generalized Ramsey numbers
Sort
View
MOC
2002
132views more  MOC 2002»
13 years 8 months ago
Comparison of algorithms to calculate quadratic irregularity of prime numbers
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k0, using the values of the zeta functi...
Joshua Holden
MOC
2011
13 years 3 months ago
Class numbers of ray class fields of imaginary quadratic fields
Let K be an imaginary quadratic field with class number one and let p ⊂ OK be a degree one prime ideal of norm p not dividing 6dK . In this paper we generalize an algorithm of S...
Omer Kucuksakalli
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
12 years 9 months ago
On Approximating the Number of Relevant Variables in a Function
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
Dana Ron, Gilad Tsur
GECCO
2005
Springer
147views Optimization» more  GECCO 2005»
14 years 2 months ago
Adaptive sizing of populations and number of islands in distributed genetic algorithms
Deciding the appropriate population size and number of islands for distributed island-model genetic algorithms is often critical to the algorithm’s success. This paper outlines ...
Johan Berntsson, Maolin Tang
DM
2010
129views more  DM 2010»
13 years 9 months ago
Interpolating between bounds on the independence number
For a non-negative integer T, we prove that the independence number of a graph G = (V, E) in which every vertex belongs to at most T triangles is at least uV f(d(u), T) where d(u)...
Anett Boßecker, Dieter Rautenbach