Sciweavers

557 search results - page 79 / 112
» Optimization Algorithms for Large Self-Structuring Networks
Sort
View
CORR
2007
Springer
95views Education» more  CORR 2007»
13 years 10 months ago
Scheduling in Data Intensive and Network Aware (DIANA) Grid Environments
In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in co...
Richard McClatchey, Ashiq Anjum, Heinz Stockinger,...
JSAC
2008
202views more  JSAC 2008»
13 years 10 months ago
Cognitive Wireless Mesh Networks with Dynamic Spectrum Access
Wireless Mesh Networks (WMNs) are envisaged to extend Internet access and other networking services in personal, local, campus, and metropolitan areas. Mesh routers (MR) form the c...
Kaushik R. Chowdhury, Ian F. Akyildiz
FPL
2009
Springer
161views Hardware» more  FPL 2009»
14 years 2 months ago
A multi-FPGA architecture for stochastic Restricted Boltzmann Machines
Although there are many neural network FPGA architectures, there is no framework for designing large, high-performance neural networks suitable for the real world. In this paper, ...
Daniel L. Ly, Paul Chow
EVOW
2007
Springer
14 years 1 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
14 years 4 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl