Sciweavers

557 search results - page 90 / 112
» Optimization Algorithms for Large Self-Structuring Networks
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 5 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
TSP
2008
179views more  TSP 2008»
13 years 10 months ago
Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
V. Chandrasekaran, Jason K. Johnson, Alan S. Wills...
DAM
2006
132views more  DAM 2006»
13 years 10 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
ISCC
2007
IEEE
14 years 4 months ago
Analysis of Load Dependency of Handover Strategies in Mobile Multiaccess Ambient Networks
Wireless operators incorporate multiradio access technologies aiming at expanding their customer base and benefiting from synergies of existing and planned infrastructure. The res...
Petteri Pöyhönen, Daniel Hollos, Haitao ...
RTSS
2007
IEEE
14 years 4 months ago
Rendezvous Planning in Mobility-Assisted Wireless Sensor Networks
Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, th...
Guoliang Xing, Tian Wang, Zhihui Xie, Weijia Jia