Sciweavers

1578 search results - page 151 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
IPPS
1996
IEEE
14 years 1 months ago
A Class of Interconnection Networks for Multicasting
Multicast, or one-to-many, communication arises frequently in parallel computing and telecommunication applications. Multicast networks can simultaneously support multiple multicas...
Yuanyuan Yang
CCGRID
2010
IEEE
13 years 10 months ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet
IWCMC
2006
ACM
14 years 2 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
ISPD
2005
ACM
140views Hardware» more  ISPD 2005»
14 years 2 months ago
Are floorplan representations important in digital design?
Research in floorplanning and block-packing has generated a variety of data structures to represent spatial configurations of circuit modules. Much of this work focuses on the g...
Hayward H. Chan, Saurabh N. Adya, Igor L. Markov
ICCS
2001
Springer
14 years 1 months ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow