<--- Back to Details
First PageDocument Content
Dynamic programming / Applied mathematics / Needleman–Wunsch algorithm / Sequence alignment / Smith–Waterman algorithm / BLAST / Sequence analysis / Algorithm / Structural alignment / Computational phylogenetics / Bioinformatics / Science
Date: 2013-09-16 12:36:54
Dynamic programming
Applied mathematics
Needleman–Wunsch algorithm
Sequence alignment
Smith–Waterman algorithm
BLAST
Sequence analysis
Algorithm
Structural alignment
Computational phylogenetics
Bioinformatics
Science

Automated Alignment of Specifications of Everyday Manipulation Tasks Moritz Tenorth Institute for Artificial Intelligence & TZI∗ University of Bremen, Germany

Add to Reading List

Source URL: ai.uni-bremen.de

Download Document from Source Website

File Size: 1,35 MB

Share Document on Facebook

Similar Documents

Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem  Nabil Abdennadher

Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem Nabil Abdennadher

DocID: 1xTOs - View Document

Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International

Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International

DocID: 1vqMk - View Document

Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore   Rahul Jain*

Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore Rahul Jain*

DocID: 1vouJ - View Document

MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming

MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming

DocID: 1vhRF - View Document

EE365: Deterministic Finite State Control  Deterministic optimal control Shortest path problem Dynamic programming Examples

EE365: Deterministic Finite State Control Deterministic optimal control Shortest path problem Dynamic programming Examples

DocID: 1vg0M - View Document