Sciweavers

567 search results - page 22 / 114
» Exact train pathing
Sort
View
GLOBECOM
2009
IEEE
15 years 6 months ago
How Bad is Single-Path Routing
—This paper investigates the network performance loss of using only single-path routing when multiple paths are available. The performance metric is the aggregate utility achieve...
Meng Wang, Chee Wei Tan, Ao Tang, Steven H. Low
VTC
2008
IEEE
15 years 6 months ago
Finding the Best QoS Path in a Gilbert Channel Network
—Many different types of modern wired and wireless communication links can be mathematically described as discretebert channels. In this extended abstract, we present an exact me...
Edwin Soedarmadji
SOFSEM
2007
Springer
15 years 6 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner
JCO
2010
82views more  JCO 2010»
14 years 10 months ago
Embedded paths and cycles in faulty hypercubes
An important task in the theory of hypercubes is to establish the maximum integer fn such that for every set F of f vertices in the hypercube Qn, with 0 ≤ f ≤ fn, there exists ...
Nelson Castañeda, Ivan S. Gotchev
PRESENCE
2008
185views more  PRESENCE 2008»
14 years 11 months ago
Pilot Evaluation Study of a Virtual Paracentesis Simulator for Skill Training and Assessment: The Beneficial Effect of Haptic Di
Effective, real-time training of health care professionals in invasive procedures is a challenging task. Furthermore, assessing in practice the acquisition of the dexterity and sk...
Costas S. Tzafestas, Kostas Birbas, Yiannis Koumpo...