Re: asymptotic behaviour of multivariate recurrence equations?
- From: "Marc Nunkesser" <marc.nunkesser@xxxxxxxxxxx>
- Date: Thu, 11 Aug 2005 14:44:45 +0200
> weights for each variable to get a univariate recurrence. David
> Eppstein's paper "Quasiconvex Analysis of Backtracking Algorithms"
> describes one method to find optimal weights, but the problem seems to
> be well-behaved numerically, so any method will probably work. See
> Fomin, Grandoni & Kratsch: "Measure and Conquer: Domination - A Case
> Study", ICALP'05 for a recent application of this kind of analysis;
> they use random local search to find the weights.
Wow, these are great papers! In Eppstein's paper he mentions a phyton
Framework for explorative algorithm analysis that looks like just what I
need. Unfortunately, I cannot find this software (neither on his webpage,
nor elsewhere on the web). Does anybody know, whether this code is publicly
available?
Cheers,
Marc.
.
- References:
- asymptotic behaviour of multivariate recurrence equations?
- From: Marc Nunkesser
- Re: asymptotic behaviour of multivariate recurrence equations?
- From: Falk Hueffner
- asymptotic behaviour of multivariate recurrence equations?
- Prev by Date: Re: Efficient way to store an isomorphism?
- Next by Date: Relation between Queueing- and Scheduling Theory
- Previous by thread: Re: asymptotic behaviour of multivariate recurrence equations?
- Next by thread: Efficient way to store an isomorphism?
- Index(es):