Sciweavers

34 search results - page 4 / 7
» An Algorithm for Constructing Hamiltonian Cycle in Metacube ...
Sort
View
EUC
2006
Springer
14 years 6 days ago
Cross-Layer Duty Cycle Scheduling with Data Aggregation Routing in Wireless Sensor Networks
Abstract. Well-scheduled communications, in conjunction with the aggregation of data reduce the energy waste on idle listening and redundant transmissions. In addition, the adjusta...
Yean-Fu Wen, Frank Yeong-Sung Lin
ICN
2005
Springer
14 years 2 months ago
Cube Connected Cycles Based Bluetooth Scatternet Formation
Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. In its design it was meant to connect a few dev...
Marcin Bienkowski, André Brinkmann, Mirosla...
TPDS
2008
199views more  TPDS 2008»
13 years 8 months ago
DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks
Abstract-- Broadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due t...
Zhenzhou Zhu, Panos Kalnis, Spiridon Bakiras
PR
2006
76views more  PR 2006»
13 years 8 months ago
A pattern recognition-based approach for phylogenetic network construction with constrained recombination
The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer...
M. A. H. Zahid, Ankush Mittal, Ramesh Chandra Josh...
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 10 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura