Sciweavers

2210 search results - page 297 / 442
» Information complexity of neural networks
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
ISCC
2006
IEEE
128views Communications» more  ISCC 2006»
16 years 17 days ago
Adjacent 2-Route Flow Approach for Restorable Dynamic Routing in MPLS Networks
In this paper we focus on issues of restorable dynamic routing in MPLS networks. We assume that the considered MPLS network must provide reliable service including restorable rout...
Krzysztof Walkowiak
KES
2005
Springer
16 years 1 days ago
Bayesian Inference Driven Behavior Network Architecture for Avoiding Moving Obstacles
This paper presents a technique for an intelligent robot to adaptively behave in unforeseen and dynamic circumstances. Since the traditional methods utilized the relatively reliabl...
Hyeun-Jeong Min, Sung-Bae Cho
VR
2003
IEEE
163views Virtual Reality» more  VR 2003»
15 years 11 months ago
Ribbon Networks for Modeling Navigable Paths of Autonomous Agents in Virtual Urban Environments
This paper presents a real-time database modeling complex networks of intersecting roads and walkways in urban virtual environments. The database represents information about the ...
Peter Willemsen, Joseph K. Kearney, Hongling Wang
CN
2008
117views more  CN 2008»
15 years 6 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...