Sciweavers

1093 search results - page 150 / 219
» Probabilistic Location and Routing
Sort
View
ATMOS
2010
134views Optimization» more  ATMOS 2010»
15 years 3 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
CGF
2011
14 years 7 months ago
Dynamic Insets for Context-Aware Graph Navigation
Maintaining both overview and detail while navigating in graphs, such as road networks, airline route maps, or social networks, is difficult, especially when targets of interest ...
S. Ghani, N. Henry Riche, N. Elmqvist
EWSN
2009
Springer
16 years 4 months ago
QoS Management for Wireless Sensor Networks with a Mobile Sink
The problem of configuration of Wireless Sensor Networks is an interesting challenge. The objective is to find the settings, for each sensor node, that optimise certain task-level ...
Rob Hoes, Twan Basten, Wai-Leong Yeow, Chen-Khong ...
EWSN
2004
Springer
16 years 3 months ago
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
Haowen Chan, Adrian Perrig
APSCC
2008
IEEE
15 years 10 months ago
Access Gateway Discovery and Selection in Hybrid Multihop Relay Vehicular Network
—Vehicular ad hoc network protocol with hybrid relay architecture is proposed for improving the success ratio. Access gateway estimation and a probability table based on the rout...
Shang-Pin Sheng, Ben-Yue Chang, Hung-Yu Wei