Sciweavers

1692 search results - page 160 / 339
» A Dynamic Network Interdiction Problem
Sort
View
129
Voted
P2P
2006
IEEE
135views Communications» more  P2P 2006»
15 years 9 months ago
Ordered Slicing of Very Large-Scale Overlay Networks
Recently there has been an increasing interest to harness the potential of P2P technology to design and build rich environments where services are provided and multiple applicatio...
Márk Jelasity, Anne-Marie Kermarrec
GECCO
2003
Springer
153views Optimization» more  GECCO 2003»
15 years 9 months ago
SEPA: Structure Evolution and Parameter Adaptation in Feed-Forward Neural Networks
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...
Paulito P. Palmes, Taichi Hayasaka, Shiro Usui
PPOPP
1999
ACM
15 years 8 months ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
124
Voted
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
15 years 7 months ago
The Brueckner network: an immobile sorting swarm
In many industrial applications, the dynamic control of queuing and routing presents difficult challenges. We describe a novel ant colony control system for a multiobjective sorti...
William A. Tozier, Michael R. Chesher, Tejinderpal...
142
Voted
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 3 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...