Sciweavers

2294 search results - page 329 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
DAM
2008
140views more  DAM 2008»
13 years 8 months ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo
HRI
2007
ACM
14 years 1 months ago
Robotic etiquette: results from user studies involving a fetch and carry task
This paper presents results, outcomes and conclusions from a series of Human Robot Interaction (HRI) trials which investigated how a robot should approach a human in a fetch and c...
Michael L. Walters, Kerstin Dautenhahn, Sarah N. W...
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 3 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
BMCBI
2007
120views more  BMCBI 2007»
13 years 9 months ago
Quantitative sequence-function relationships in proteins based on gene ontology
Background: The relationship between divergence of amino-acid sequence and divergence of function among homologous proteins is complex. The assumption that homologs share function...
Vineet Sangar, Daniel J. Blankenberg, Naomi Altman...
TON
2010
152views more  TON 2010»
13 years 7 months ago
1 + N network protection for mesh networks: network coding-based protection using p-cycles
—p-Cycles have been proposed for preprovisioned 1 : N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the ...
Ahmed E. Kamal