Sciweavers

312 search results - page 30 / 63
» An experimental study on algorithms for drawing binary trees
Sort
View
MOBIHOC
2007
ACM
14 years 7 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
ICS
2009
Tsinghua U.
14 years 4 days ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
CPAIOR
2005
Springer
14 years 1 months ago
Computing Explanations for the Unary Resource Constraint
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
Petr Vilím
ICPADS
2008
IEEE
14 years 2 months ago
Response Time Constrained Top-k Query Evaluation in Sensor Networks
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k que...
Weifa Liang, Baichen Chen, Jeffrey Xu Yu
ICCAD
1997
IEEE
91views Hardware» more  ICCAD 1997»
13 years 11 months ago
Interconnect layout optimization under higher-order RLC model
In this paper, we study the interconnect layout optimization problem under a higher-order RLC model to optimize not just delay, but also waveform for RLC circuits with non-monoton...
Jason Cong, Cheng-Kok Koh