Skip to content

Algorithm description #3

@skinkie

Description

@skinkie

If a probability is described, when does it dominate an alternative result given a pareto optimal search? I mean give a distribution it either could be at a timeband that overlaps but not absolutely dominating. Is it similar to Minimum Expected Arrival Time from Connection Scan Algorithm? How does this play out in the case of transfers?

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type
    No fields configured for issues without a type.

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions