Sciweavers

2899 search results - page 105 / 580
» Dynamic Trees in Practice
Sort
View
LCN
2002
IEEE
14 years 1 months ago
Scalable Multicast Routing Protocol Using Anycast and Hierarchical-Trees
A novel efficiency and effectiveness Internet multicast routing protocol is presented with short delay, high throughput, resource utilization and scalability for a single multicas...
Weijia Jia, Pui-on Au, Gaochao Xu, Wei Zhao
IJFCS
2006
82views more  IJFCS 2006»
13 years 9 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...
ICCAD
1997
IEEE
137views Hardware» more  ICCAD 1997»
14 years 16 days ago
Optimization techniques for high-performance digital circuits
The relentless push for high performance in custom digital circuits has led to renewed emphasis on circuit optimization or tuning. The parameters of the optimization are typically...
Chandramouli Visweswariah
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
13 years 10 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin
CSL
2007
Springer
14 years 3 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart