Sciweavers

1736 search results - page 101 / 348
» The rank-width of Directed Graphs
Sort
View
AAAI
2004
15 years 5 months ago
A Correspondence Metric for Imitation
Abstract-- Learning by imitation and learning from demonstration have received considerable attention in robotics. However, very little research has been in the direction of provid...
R. Amit, Maja J. Mataric
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 4 months ago
The road coloring problem
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
A. N. Trahtman
NAR
2006
129views more  NAR 2006»
15 years 4 months ago
AliWABA: alignment on the web through an A-Bruijn approach
Multiple sequence alignment programs are an invaluable tool in computational biology. A-Bruijn Alignment (ABA) is a method for multiple sequence alignment that represents an align...
Neil C. Jones, Degui Zhi, Benjamin J. Raphael
MP
1998
136views more  MP 1998»
15 years 3 months ago
Minimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
Daniel Bienstock, Sunil Chopra, Oktay Günl&uu...
EMSOFT
2011
Springer
14 years 4 months ago
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
Mohamed Bamakhrama, Todor Stefanov