Sciweavers

625 search results - page 82 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
131
Voted
AINA
2009
IEEE
15 years 8 months ago
A Range-Only Tracking Algorithm for Wireless Sensor Networks
Over the last few years, target tracking in wireless sensor networks has become a topic of particular interest. This paper presents a tracking system intended for deployment in di...
Evangelos B. Mazomenos, Jeffrey S. Reeve, Neil M. ...
NN
2002
Springer
115views Neural Networks» more  NN 2002»
15 years 1 months ago
A self-organising network that grows when required
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow
IPPS
2007
IEEE
15 years 8 months ago
Link Shutdown Opportunities During Collective Communications in 3-D Torus Nets
As modern computing clusters used in scientific computing applications scale to ever-larger sizes and capabilities, their operational energy costs have become prohibitive. While ...
S. Conner, Sayaka Akioka, Mary Jane Irwin, Padma R...
133
Voted
SPAA
2004
ACM
15 years 7 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
CN
2004
129views more  CN 2004»
15 years 1 months ago
Dynamic traffic controls for Web-server networks
Distributed Web-server systems have been widely used to provide effective Internet services. The management of these systems requires dynamic controls of the Web traffic. With the...
Liming Liu, Yumao Lu