Approximations by OBDDs and the Variable Ordering Problem

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: Reihe Computational Intelligence ; 58

Event: Veröffentlichung

(where): Dortmund

(who): Universitätsbibliothek Dortmund

(when): 2001

Creator: Krause, Matthias
Savický, Petr
Wegener, Ingo

Handle: 2003/5367

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

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

Last update: 25.03.2025, 1:55 PM CET

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

Krause, Matthias
Savický, Petr
Wegener, Ingo
Universitätsbibliothek Dortmund

Time of origin

2001

Other Objects (12)

Hochschulschrift

Vector optimization problems with variable ordering structures

Ordering variable for parton showers

Variable ordering structures in vector optimization

Variable ordering structures - what can be assumed?

Output Optimization by Lie Bracket Approximations

Hochschulschrift

Approximations and asymptotic expansions for sums of heavy-tailed random variables

Constructing lattice bases by means of approximations

High order approximations by sampled-data feedback

Hochschulschrift

Approximations by families of linear polynomial operators

Archimedean approximations

Hochschulschrift

Ranking and ordering problems of spanning trees

Hochschulschrift

The linear ordering problem: algorithms and applications

Hochschulschrift

Vector optimization problems with variable ordering structures

Ordering variable for parton showers

Variable ordering structures in vector optimization

Variable ordering structures - what can be assumed?

Output Optimization by Lie Bracket Approximations

Hochschulschrift

Approximations and asymptotic expansions for sums of heavy-tailed random variables

Constructing lattice bases by means of approximations

High order approximations by sampled-data feedback

Hochschulschrift

Approximations by families of linear polynomial operators

Archimedean approximations

Hochschulschrift

Ranking and ordering problems of spanning trees

Hochschulschrift

The linear ordering problem: algorithms and applications

Hochschulschrift

Vector optimization problems with variable ordering structures

Ordering variable for parton showers

Variable ordering structures in vector optimization

Variable ordering structures - what can be assumed?

Output Optimization by Lie Bracket Approximations

Hochschulschrift

Approximations and asymptotic expansions for sums of heavy-tailed random variables

Constructing lattice bases by means of approximations

High order approximations by sampled-data feedback

Hochschulschrift

Approximations by families of linear polynomial operators

Archimedean approximations

Hochschulschrift

Ranking and ordering problems of spanning trees

Hochschulschrift

The linear ordering problem: algorithms and applications

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.

Approximations by OBDDs and the Variable Ordering Problem

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Vector optimization problems with variable ordering structures

Ordering variable for parton showers

Variable ordering structures in vector optimization

Variable ordering structures - what can be assumed?

Output Optimization by Lie Bracket Approximations

Approximations and asymptotic expansions for sums of heavy-tailed random variables

Constructing lattice bases by means of approximations

High order approximations by sampled-data feedback

Approximations by families of linear polynomial operators

Archimedean approximations

Ranking and ordering problems of spanning trees

The linear ordering problem: algorithms and applications

Vector optimization problems with variable ordering structures

Ordering variable for parton showers

Variable ordering structures in vector optimization

Variable ordering structures - what can be assumed?

Output Optimization by Lie Bracket Approximations

Approximations and asymptotic expansions for sums of heavy-tailed random variables

Constructing lattice bases by means of approximations

High order approximations by sampled-data feedback

Approximations by families of linear polynomial operators

Archimedean approximations

Ranking and ordering problems of spanning trees

The linear ordering problem: algorithms and applications

Vector optimization problems with variable ordering structures

Ordering variable for parton showers

Variable ordering structures in vector optimization

Variable ordering structures - what can be assumed?

Output Optimization by Lie Bracket Approximations

Approximations and asymptotic expansions for sums of heavy-tailed random variables

Constructing lattice bases by means of approximations

High order approximations by sampled-data feedback

Approximations by families of linear polynomial operators

Archimedean approximations

Ranking and ordering problems of spanning trees

The linear ordering problem: algorithms and applications

Related objects

Reset password