Sciweavers

683 search results - page 116 / 137
» Driver Destination Models
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 9 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
CORR
2010
Springer
175views Education» more  CORR 2010»
14 years 8 months ago
Efficient Packet Forwarding Approach in Vehicular Ad Hoc Networks Using EBGR Algorithm
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing ...
K. Prasanth, K. Duraiswamy, K. Jayasudha, C. Chand...
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 8 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
ICIP
2010
IEEE
14 years 7 months ago
Real-time interactive multi-target tracking using kernel-based trackers
Although kernel-based methods have been demonstrated effectively in solving single-target tracking problem, facing more complicated multi-target tracking task, most of them still ...
Guorong Li, Wei Qu, Qingming Huang
WICON
2010
14 years 7 months ago
Optimized Content Caching and Request Capture in CNF Networks
In order to meet the overwhelming demands of content retrieval for mobile end users, a novel architecture for the next-generation Internet called Cache-and-Forward (CNF) has been p...
Lijun Dong, Dan Zhang, Yanyong Zhang, Dipankar Ray...