Sciweavers

4781 search results - page 293 / 957
» Online algorithms for network design
Sort
View
MOBIHOC
2012
ACM
13 years 9 months ago
Channel width assignment using relative backlog: extending back-pressure to physical layer
With recent advances in Software-defined Radios (SDRs), it has indeed became feasible to dynamically adapt the channel widths at smaller time scales. Even though the advantages o...
Parth H. Pathak, Sankalp Nimbhorkar, Rudra Dutta
IPL
2011
91views more  IPL 2011»
14 years 10 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
IJCNN
2006
IEEE
16 years 24 days ago
Divide and Conquer Strategies for MLP Training
— Over time, neural networks have proven to be extremely powerful tools for data exploration with the capability to discover previously unknown dependencies and relationships in ...
Smriti Bhagat, Dipti Deodhare
RAID
2001
Springer
15 years 11 months ago
Aggregation and Correlation of Intrusion-Detection Alerts
Abstract. This paper describes an aggregation and correlation algorithm used in the design and implementation of an intrusion-detection console built on top of the Tivoli Enterpris...
Hervé Debar, Andreas Wespi
IPPS
1997
IEEE
15 years 11 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen