Sciweavers

5922 search results - page 218 / 1185
» Navigability of Complex Networks
Sort
View
136
Voted
CONEXT
2009
ACM
15 years 4 months ago
Feasibility of content dissemination between devices in moving vehicles
We investigate the feasibility of content distribution between devices mounted in moving vehicles using commodity WiFi. We assume that each device stores content in a set of files...
Thomas Zahn, Greg O'Shea, Antony I. T. Rowstron
119
Voted
NN
2000
Springer
150views Neural Networks» more  NN 2000»
15 years 3 months ago
Multi-step-ahead prediction using dynamic recurrent neural networks
A method for the development of empirical predictive models for complex processes is presented. The models are capable of performing accurate multi-step-ahead (MS) predictions, wh...
Alexander G. Parlos, Omar T. Rais, Amir F. Atiya
CP
2005
Springer
15 years 8 months ago
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
15 years 8 months ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
15 years 8 months ago
Designing resilient networks using a hybrid genetic algorithm approach
As high-speed networks have proliferated across the globe, their topologies have become sparser due to the increased capacity of communication media and cost considerations. Relia...
Abdullah Konak, Alice E. Smith