Sciweavers

1578 search results - page 105 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
ADHOC
2010
173views more  ADHOC 2010»
13 years 5 months ago
A new distributed topology control algorithm for wireless environments with non-uniform path loss and multipath propagation
Each node in a wireless multi-hop network can adjust the power level at which it transmits and thus change the topology of the network to save energy by choosing the neighbors wit...
Harish Sethu, Thomas Gerety
CCGRID
2008
IEEE
14 years 3 months ago
Joint Communication and Computation Task Scheduling in Grids
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...
TON
2010
210views more  TON 2010»
13 years 3 months ago
A New Approach to Optical Networks Security: Attack-Aware Routing and Wavelength Assignment
Abstract-- Security issues and attack management in transparent WDM (Wavelength Division Multiplexing) optical networks has become of prime importance to network operators due to t...
Nina Skorin-Kapov, J. Chen, Lena Wosinska
FSTTCS
2007
Springer
14 years 3 months ago
Undirected Graphs of Entanglement 2
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
DBISP2P
2004
Springer
150views Database» more  DBISP2P 2004»
14 years 2 months ago
Adapting the Content Native Space for Load Balanced Indexing
Today, there is an increasing demand to share data with complex data types (e.g., multi-dimensional) over large numbers of data sources. One of the key challenges is sharing these ...
Yanfeng Shu, Kian-Lee Tan, Aoying Zhou