Sciweavers

597 search results - page 55 / 120
» Homomorphisms of random paths
Sort
View
CN
2007
154views more  CN 2007»
13 years 10 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
AROBOTS
2002
98views more  AROBOTS 2002»
13 years 9 months ago
Dynamically-Stable Motion Planning for Humanoid Robots
We present an approach to path planning for humanoid robots that computes dynamically-stable, collision-free trajectories from full-body posture goals. Given a geometric model of t...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
TMC
2011
201views more  TMC 2011»
13 years 4 months ago
Data Delivery Properties of Human Contact Networks
—Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the huma...
Nishanth Sastry, D. Manjunath, Karen R. Sollins, J...
INFOCOM
2003
IEEE
14 years 3 months ago
A Framework for Reliable Routing in Mobile Ad Hoc Networks
— Mobile ad hoc networks consist of nodes that are often vulnerable to failure. As such, it is important to provide redundancy in terms of providing multiple nodedisjoint paths f...
Zhenqiang Ye, Srikanth V. Krishnamurthy, Satish K....
TCBB
2010
144views more  TCBB 2010»
13 years 4 months ago
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
Guillaume Blin, Florian Sikora, Stéphane Vi...