Sciweavers

363 search results - page 26 / 73
» About paths with two blocks
Sort
View
TON
2010
129views more  TON 2010»
13 years 8 months ago
QoS-based manycasting over optical burst-switched (OBS) networks
Abstract—Many distributed applications require a group of destinations to be coordinated with a single source. Multicasting is a communication paradigm to implement these distrib...
Balagangadhar G. Bathula, Vinod Vokkarane
TMC
2002
118views more  TMC 2002»
13 years 9 months ago
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management
The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two importan...
Yu-Chee Tseng, Chih-Min Chao
ASPDAC
2001
ACM
105views Hardware» more  ASPDAC 2001»
14 years 1 months ago
Toward better wireload models in the presence of obstacles
Wirelength estimation techniques typically contain a site density function that enumerates all possible path sites for each wirelength in an architecture and an occupation probabil...
Chung-Kuan Cheng, Andrew B. Kahng, Bao Liu, Dirk S...
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
14 years 4 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
VR
2000
IEEE
172views Virtual Reality» more  VR 2000»
14 years 2 months ago
An Intelligent User Interface with Motion Planning for 3D Navigation
Due to the rapid evolution of graphics hardware, interactive 3D graphics is becoming popular on desktop personal computers. However, it remains a challenging task for a novice use...
Tsai-Yen Li, Hung-Kai Ting