General lower bounds for randomized direct search with isotropic sampling

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: Reihe CI ; 233-07

Event: Veröffentlichung

(where): Dortmund

(who): Universitätsbibliothek Dortmund

(when): 2007

Creator: Jägersküpper, Jens

Handle: 2003/26140

URN: urn:nbn:de:101:1-201604131744

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:51 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Jägersküpper, Jens
Universitätsbibliothek Dortmund

Time of origin

2007

Other Objects (12)

Proportionality’s Lower Bound

Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies

Upper and lower bounds for randomized search heuristics in black box optimization

zweidimensionales bewegtes Bild

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Treewidth Lower Bounds with Brambles

Hochschulschrift

Lower Bounds for Heuristic Algorithms

Multiple importance sampling revisited: breaking the bounds

A New Upper Bound for Sampling Numbers

Maximum common subgraph: some upper bound and lower bound results

Arbeitspapier

Zero Lower Bound on Inflation Expectations

Proportionality’s Lower Bound

Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies

Upper and lower bounds for randomized search heuristics in black box optimization

zweidimensionales bewegtes Bild

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Treewidth Lower Bounds with Brambles

Hochschulschrift

Lower Bounds for Heuristic Algorithms

Multiple importance sampling revisited: breaking the bounds

A New Upper Bound for Sampling Numbers

Maximum common subgraph: some upper bound and lower bound results

Arbeitspapier

Zero Lower Bound on Inflation Expectations

Proportionality’s Lower Bound

Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies

Upper and lower bounds for randomized search heuristics in black box optimization

zweidimensionales bewegtes Bild

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Treewidth Lower Bounds with Brambles

Hochschulschrift

Lower Bounds for Heuristic Algorithms

Multiple importance sampling revisited: breaking the bounds

A New Upper Bound for Sampling Numbers

Maximum common subgraph: some upper bound and lower bound results

Arbeitspapier

Zero Lower Bound on Inflation Expectations

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

General lower bounds for randomized direct search with isotropic sampling

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Proportionality’s Lower Bound

Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies

Upper and lower bounds for randomized search heuristics in black box optimization

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Treewidth Lower Bounds with Brambles

Lower Bounds for Heuristic Algorithms

Multiple importance sampling revisited: breaking the bounds

A New Upper Bound for Sampling Numbers

Maximum common subgraph: some upper bound and lower bound results

Zero Lower Bound on Inflation Expectations

Proportionality’s Lower Bound

Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies

Upper and lower bounds for randomized search heuristics in black box optimization

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Treewidth Lower Bounds with Brambles

Lower Bounds for Heuristic Algorithms

Multiple importance sampling revisited: breaking the bounds

A New Upper Bound for Sampling Numbers

Maximum common subgraph: some upper bound and lower bound results

Zero Lower Bound on Inflation Expectations

Proportionality’s Lower Bound

Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies

Upper and lower bounds for randomized search heuristics in black box optimization

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Treewidth Lower Bounds with Brambles

Lower Bounds for Heuristic Algorithms

Multiple importance sampling revisited: breaking the bounds

A New Upper Bound for Sampling Numbers

Maximum common subgraph: some upper bound and lower bound results

Zero Lower Bound on Inflation Expectations

Related objects

Reset password