8000 Define the optimal search as a new graph optimization · Issue #27 · citiususc/composit · GitHub
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

Define the optimal search as a new graph optimization #27

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue a 86A8 nd contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Open
pablormier opened this issue Apr 4, 2014 · 0 comments
Open

Define the optimal search as a new graph optimization #27

pablormier opened this issue Apr 4, 2014 · 0 comments
Labels
task

Comments

@pablormier
Copy link
Contributor

The optimal composition search can be viewed as a particular composition graph optimization that selects only the minimal set of services that satisfy the request and returns the resultant (minimal) composition graph
@pablormier pablormier added the task label Apr 4, 2014
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
task
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@pablormier
0